Euclid JS

The diagram at the right comes from parsing the text below using euclid-parser, which is generated from this grammar using PEG.js.

[main-figure] Let a = (300, 300). Let b = (500, 300). Let c = (300, 400). Let s be a segment with endpoints a and b. Let t be a segment with endpoints b and c. Let u be a segment from a to c. [guides] Let k be a circle centered at a containing b. Let l be a circle centered at b containing a. Let m be the circle centered at b containing c. Let n be the circle centered at c containing b. d = the intersection of k and l e = the intersection of k and l that is not d f = the intersection of m and n g = the intersection of m and n that is not f [perpendicular-bisectors] Let v be the line determined by d and e Let w be the line determined by f and g [result] Let O be the intersection of v and w Draw the circle centered at O containing a.