forked from arch571/manim-geometry-visualizer
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgvproblem.py
97 lines (78 loc) · 2.9 KB
/
gvproblem.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
from parsimonious.grammar import Grammar
from parsimonious.nodes import NodeVisitor
class GVProblem(NodeVisitor):
RULES = r"""
problem = (section / space)+
section = sectionstart statement*
space = ~r"\s*"
sectionstart = lsquarebracket lowerword rsquarebracket
lbracket = "("
rbracket = ")"
lsquarebracket = "["
rsquarebracket = "]"
lowerword = ~"[_a-z]+"
quote = "\""
equals = space "=" space
parallel = space "||" space
function = ~r"\w+" lbracket funcargs rbracket
statement = space (function / expr) ((equals / parallel) expr)? namedcomments?
namedcomments = space description
description = "#desc" space ~r".+"
funcargs = expr (space "," space expr)*
expr = numexpr / labels / string
string = quote ~r"[^\"]+" quote
numexpr = ~r"\d+"
labels = ~r"[A-Z]+"
"""
def parse(self, str):
grammar = Grammar(self.RULES)
tree = grammar.parse(str)
return self.visit(tree)
def visit_problem(self, node, visited_children):
return [ v[0] for v in visited_children ]
# return visited_children
def visit_sectionstart(self, node, visited_children):
_, section, _ = visited_children
return section.text
def visit_statement(self, node, visited_children):
rhs = visited_children[2]
lhs = visited_children[1][0]
if isinstance(rhs, list):
operator, rhs_expr = rhs[0]
if operator[0] == '||':
lhs["function"] = "ParallelLine"
lhs["args"].append(rhs_expr)
if isinstance(visited_children[3] , list):
lhs["comments"] = visited_children[3][0]
return lhs
def visit_section(self, node, visited_children):
section_name, statements = visited_children
return visited_children
def visit_namedcomments(self, node, visited_children):
return visited_children[1]
def visit_space(self, node, visited_children):
return ''
def visit_function(self, node, visited_children):
return { "function": visited_children[0].text, "args": visited_children[2] }
def visit_expr(self, node, visited_children):
return visited_children[0]
def visit_equals(self, node, visited_children):
return '='
def visit_description(self, node, visited_children):
return visited_children[2].text
def visit_parallel(self, node, visited_children):
return '||'
def visit_numexpr(self, node, visited_children):
return float(node.text)
def visit_labels(self, node, visited_children):
return str(node.text)
def visit_string(self, node, visited_children):
return node.children[1].text
def visit_funcargs(self, node, visited_children):
result = [ visited_children[0] ]
# if it has additional params
if isinstance(visited_children[1], list):
result.extend([ c[3] for c in visited_children[1]])
return result
def generic_visit(self, node, visited_children):
return visited_children or node