-
-
Notifications
You must be signed in to change notification settings - Fork 11
/
choice.py
132 lines (112 loc) · 4.85 KB
/
choice.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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
'''pyleri.Choice Class.
Choose one of the given elements. When most_greedy is True we will choose
the 'longest' element when multiple elements are valid. If most_greedy is
False we will return the first match.
:copyright: 2015, Jeroen van der Heijden (Transceptor Technology)
'''
from .elements import NamedElement, c_export, go_export, java_export
class Choice(NamedElement):
__slots__ = ('_elements', '_get_node_result')
def __init__(self, *elements, most_greedy=True):
self._elements = self._validate_elements(elements)
self._get_node_result = \
self._most_greedy_result if most_greedy else \
self._stop_at_first_match
def _most_greedy_result(self, root, tree, rule, s, node):
mg_is_valid, mg_pos = False, node.start
for elem in self._elements:
children = []
is_valid, pos = root._walk(elem, node.start, children, rule, True)
if is_valid and pos > mg_pos:
node.children = children
mg_is_valid, mg_pos = is_valid, pos
if mg_is_valid:
root._append_tree(tree, node, mg_pos)
return mg_is_valid, mg_pos
def _stop_at_first_match(self, root, tree, rule, s, node):
for elem in self._elements:
children = []
is_valid, pos = root._walk(elem, node.start, children, rule, True)
if is_valid:
node.children = children
root._append_tree(tree, node, pos)
break
return is_valid, pos
def _run_export_js(self, js_indent, indent, classes, cname):
return self._export_js_elements(js_indent, indent, classes, cname)
def _run_export_py(self, py_indent, indent, classes):
new_indent = indent + 1
value = ',\n'.join(['{indent}{elem}'.format(
indent=py_indent * new_indent,
elem=elem._export_py(
py_indent,
new_indent,
classes)) for elem in self._elements])
return 'Choice(\n{val},\n{indent}most_greedy={mg})'.format(
mg='{mg}'.format(
indent=py_indent * (indent + 1),
mg=('False', 'True')[
self._get_node_result == self._most_greedy_result]),
val=value,
indent=py_indent * new_indent)
@c_export
def _run_export_c(self, c_indent, indent, enums, gid):
new_indent = indent + 1
value = ',\n'.join(['{indent}{elem}'.format(
indent=c_indent * new_indent,
elem=elem._export_c(
c_indent,
new_indent,
enums)) for elem in self._elements])
return 'cleri_choice(\n{gid},\n{mg},\n{num},\n{val}\n{indent})'.format(
gid='{indent}{gid}'.format(
indent=c_indent * (indent + 1),
gid=gid),
mg='{indent}{mg}'.format(
indent=c_indent * (indent + 1),
mg=('CLERI_FIRST_MATCH', 'CLERI_MOST_GREEDY')[
self._get_node_result == self._most_greedy_result]),
num='{indent}{num}'.format(
indent=c_indent * (indent + 1),
num=len(self._elements)),
val=value,
indent=c_indent * indent)
@go_export
def _run_export_go(self, go_indent, indent, enums, gid):
new_indent = indent + 1
value = ',\n'.join(['{indent}{elem}'.format(
indent=go_indent * new_indent,
elem=elem._export_go(
go_indent,
new_indent,
enums)) for elem in self._elements])
return 'goleri.NewChoice(\n{gid},\n{mg},\n{val},\n{indent})'.format(
gid='{indent}{gid}'.format(
indent=go_indent * (indent + 1),
gid=gid),
mg='{indent}{mg}'.format(
indent=go_indent * (indent + 1),
mg=('false', 'true')[
self._get_node_result == self._most_greedy_result]),
val=value,
indent=go_indent * indent)
@java_export
def _run_export_java(self, java_indent, indent, enums, classes, gid):
new_indent = indent + 1
value = ',\n'.join(['{indent}{elem}'.format(
indent=java_indent * new_indent,
elem=elem._export_java(
java_indent,
new_indent,
enums,
classes)) for elem in self._elements])
return 'new Choice({gid}\n{mg},\n{val}\n{indent})'.format(
gid='' if gid is None else '\n{indent}Ids.{gid},'.format(
indent=java_indent * (indent + 1),
gid=gid),
mg='{indent}{mg}'.format(
indent=java_indent * (indent + 1),
mg=('false', 'true')[
self._get_node_result == self._most_greedy_result]),
val=value,
indent=java_indent * indent)