-
Notifications
You must be signed in to change notification settings - Fork 0
/
bnf_tools.py
245 lines (187 loc) · 6.38 KB
/
bnf_tools.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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
#!/usr/bin/env python
# -*-mode: python -*- -*- coding: utf-8 -*-
"""
Do this stuff with some sort of rules...?
(XSTL? RIF? ...)
"""
import re
import htmlentitydefs
import AST2
import plugin
NS = "http://www.w3.org/2009/02/blindfold/ns#"
def deepcopy(n):
return n.deepcopy()
################################################################
class TokenSet:
def __init__(self):
self.token_name = {}
self.count = 0
def ingest(self, grammar):
"""Run through a grammar, converting the literals into token
references, and build up this TokenSet.
"""
return grammar.map_replace(str_to_tok, self)
def get_name(self, text):
try:
return self.token_name[text]
except KeyError:
if is_word(text):
# not a good idea to just use it, bare, because it's
# likely to conflict with some non-terminals
name = "kw_"+text
else:
name_parts = []
for char in text:
name_parts.append(char_name(char).upper())
name = "_".join(name_parts)
#self.count += 1
#name = "tok_%03d" % self.count
assert is_word(name)
self.token_name[text] = name
return name
def for_lex(self):
s = ""
r = ""
t = ""
for (text, name) in self.token_name.items():
if is_word(text):
r += "reserved['%-15s = '%s'\n" % (text+"']", name)
else:
s += "t_%-15s = re.escape(%s)\n" % (name, `text`)
t += "tokens.append('%s')\n" % name
result = ""
result += r
result += "\n"
result += s
result += "\n"
result += t
result += "\n"
return result
word_pat = re.compile(r'''^[a-zA-Z_][a-zA-Z_0-9]*$''')
def is_word(text):
m = word_pat.match(text)
return m is not None
def str_to_tok(node, tokens):
if node.has_type("Literal"):
name = tokens.get_name(node.text.the.lexrep)
node = AST2.Instance(("Reference"), name=AST2.string(name))
return node
char_names = {
')': 'rparen',
'(': 'lparen',
'*': 'star',
'/': 'slash',
'-': 'dash',
'+': 'plus',
'#': 'hash',
'=': 'equals',
':': 'colon',
']': 'rbracket',
'[': 'lbracket',
'}': 'lbrace',
'|': 'vbar',
'{': 'rbrace',
'.': 'dot',
';': 'semi',
',': 'comma',
'?': 'question',
'<': 'lt',
'>': 'gt',
'%': 'percent',
}
def char_name(char):
try:
return htmlentitydefs.codepoint2name[ord(char)]
except KeyError:
pass
if char.isalpha():
return char
if char.isdigit():
return "DIGIT"+char
try:
return char_names[char]
except KeyError:
pass
n = "chr%d" % ord(char)
# print " '%s': '', " % char
char_names[char] = n
return char_names[char]
################################################################
def convert_to_yacc_form(root):
save = AST2.default_namespace
AST2.default_namespace = NS
additions = []
root = root.map_replace(convert_plus, additions)
root = root.map_replace(convert_star, additions)
root = root.map_replace(convert_optional, additions)
#root.productions=AST2.Sequence()
for p in additions:
root.productions.the.append(p)
root = root.map_replace(convert_Alt_to_AltN)
root = root.map_replace(convert_AltN_to_branches)
# disallow nested Alt
save = AST2.default_namespace
class Plugin (plugin.TransformPlugin) :
"""Convert (arbitrary) grammars to yacc-style grammars. Kind of like converting logical formula to Conjunctive Normal Form.
"""
id = "to_yacc"
def transform(self, root):
convert_to_yacc_form(root)
return root
plugin.register(Plugin)
def convert_plus(node, additions):
if node.has_type('Plus'):
name = AST2.string("_plus_gen%d" % len(additions))
e = AST2.Instance(('Alt'),
left=deepcopy(node.expr.the),
right=AST2.Instance(('Seq'),
left=AST2.Instance(('Reference'),
name=name),
right=deepcopy(node.expr.the)
)
)
additions.append(AST2.Instance(('Production'), name=name, expr=e))
node = AST2.Instance(('Reference'), name=name)
return node
def convert_star(node, additions):
if node.has_type('Star'):
name = AST2.string("_star_gen%d" % len(additions))
e = AST2.Instance(('Alt'),
left=AST2.Instance(('Reference'), name='EMPTY'),
right=AST2.Instance(('Seq'),
left=AST2.Instance(('Reference'),
name=name),
right=deepcopy(node.expr.the)
)
)
additions.append(AST2.Instance(('Production'), name=name, expr=e))
node = AST2.Instance(('Reference'), name=name)
return node
def convert_optional(node, additions):
if node.has_type('Optional'):
name = AST2.string("_optional_gen%d" % len(additions))
e = AST2.Instance(('Alt'),
left=AST2.Instance(('Reference'), name=AST2.string('EMPTY')),
right=deepcopy(node.expr.the)
)
additions.append(AST2.Instance(('Production'), name=name, expr=e))
node = AST2.Instance(('Reference'), name=name)
return node
def convert_Alt_to_AltN(node):
if node.has_type("Alt"):
exprs = AST2.Sequence()
for side in (node.left.the, node.right.the):
if side.has_type("AltN"):
exprs.extend(side.exprs.the.items)
else:
exprs.append(side)
return AST2.Instance(('AltN'), exprs=exprs)
else:
return node
def convert_AltN_to_branches(node):
if node.has_type("Production"):
if node.expr.the.has_type('AltN'):
node.branches = node.expr.the.exprs.the
else:
node.branches = AST2.Sequence([node.expr.the])
return node