forked from googleprojectzero/domato
-
Notifications
You must be signed in to change notification settings - Fork 1
/
grammar.py
executable file
·1033 lines (889 loc) · 36.5 KB
/
grammar.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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# Domato - grammar parser and generator
# --------------------------------------
#
# Written and maintained by Ivan Fratric <[email protected]>
#
# Copyright 2017 Google Inc. All Rights Reserved.
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
from __future__ import print_function
import bisect
try:
from html import escape as _escape
except ImportError:
from cgi import escape as _escape
import os
import random
import re
import struct
_INT_RANGES = {
'int': [-2147483648, 2147483647],
'int32': [-2147483648, 2147483647],
'uint32': [0, 4294967295],
'int8': [-128, 127],
'uint8': [0, 255],
'int16': [-32768, 32767],
'uint16': [0, 65536],
'int64': [-9223372036854775808, 9223372036854775807],
'uint64': [0, 18446744073709551615]
}
_INT_FORMATS = {
'int': 'i',
'int32': 'i',
'uint32': 'I',
'int8': 'b',
'uint8': 'B',
'int16': 'h',
'uint16': 'H',
'int64': 'q',
'uint64': 'Q'
}
_NONINTERESTING_TYPES = [
'short',
'long',
'DOMString',
'boolean',
'float',
'double'
]
class Error(Exception):
pass
class GrammarError(Error):
"""An exception class for parsing errors."""
pass
class RecursionError(Error):
"""An exception class for reaching maximum recursion depth."""
pass
class Grammar(object):
"""Parses grammar and generates corresponding languages.
To use you need to first parse the grammar definition file, example:
>>> grammar = Grammar()
>>> grammar.parse_from_file('grammar.txt')
After this, you can generate the language starting from the root symbol:
>>> ret = grammar.generate_root()
Or a specific symbol
>>> ret = grammar.generate_symbol('foo')
"""
def __init__(self):
self._root = ''
self._creators = {}
self._nonrecursive_creators = {}
self._all_rules = []
self._interesting_lines = {}
self._all_nonhelper_lines = []
self._creator_cdfs = {}
self._nonrecursivecreator_cdfs = {}
self._var_format = 'var%05d'
self._definitions_dir = '.'
self._imports = {}
self._functions = {}
self._line_guard = ''
self._recursion_max = 50
self._var_reuse_prob = 0.75
self._interesting_line_prob = 0.9
self._max_vars_of_same_type = 5
self._inheritance = {}
self._cssgrammar = None
# Helper dictionaries for creating built-in types.
self._constant_types = {
'lt': '<',
'gt': '>',
'hash': '#',
'cr': chr(13),
'lf': chr(10),
'space': ' ',
'tab': chr(9),
'ex': '!'
}
self._built_in_types = {
'int': self._generate_int,
'int32': self._generate_int,
'uint32': self._generate_int,
'int8': self._generate_int,
'uint8': self._generate_int,
'int16': self._generate_int,
'uint16': self._generate_int,
'int64': self._generate_int,
'uint64': self._generate_int,
'float': self._generate_float,
'double': self._generate_float,
'char': self._generate_char,
'string': self._generate_string,
'htmlsafestring': self._generate_html_string,
'hex': self._generate_hex,
'import': self._generate_import,
'lines': self._generate_lines
}
self._command_handlers = {
'varformat': self._set_variable_format,
'include': self._include_from_file,
'import': self._import_grammar,
'lineguard': self._set_line_guard,
'max_recursion': self._set_recursion_depth,
'var_reuse_prob': self._set_var_reuse_probability,
'extends': self._set_extends
}
def _string_to_int(self, s):
return int(s, 0)
def _generate_int(self, tag):
"""Generates integer types."""
tag_name = tag['tagname']
default_range = _INT_RANGES[tag_name]
min_value = default_range[0]
if 'min' in tag:
min_value = self._string_to_int(tag['min'])
max_value = default_range[1]
if 'max' in tag:
max_value = self._string_to_int(tag['max'])
if min_value > max_value:
raise GrammarError('Range error in integer tag')
i = random.randint(min_value, max_value)
if 'b' in tag or 'be' in tag:
if 'be' in tag:
fmt = '>' + _INT_FORMATS[tag_name]
else:
fmt = '<' + _INT_FORMATS[tag_name]
return struct.pack(fmt, i)
else:
return str(i)
def _generate_float(self, tag):
"""Generates floating point types."""
min_value = float(tag.get('min', '0'))
max_value = float(tag.get('max', '1'))
if min_value > max_value:
raise GrammarError('Range error in a float tag')
f = min_value + random.random() * (max_value - min_value)
if 'b' in tag:
if tag['tagname'] == 'float':
return struct.pack('f', f)
else:
return struct.pack('d', f)
else:
return str(f)
def _generate_char(self, tag):
"""Generates a single character."""
if 'code' in tag:
return chr(self._string_to_int(tag['code']))
min_value = self._string_to_int(tag.get('min', '0'))
max_value = self._string_to_int(tag.get('max', '255'))
if min_value > max_value:
raise GrammarError('Range error in char tag')
return chr(random.randint(min_value, max_value))
def _generate_string(self, tag):
"""Generates a random string."""
min_value = self._string_to_int(tag.get('min', '0'))
max_value = self._string_to_int(tag.get('max', '255'))
if min_value > max_value:
raise GrammarError('Range error in string tag')
minlen = self._string_to_int(tag.get('minlength', '0'))
maxlen = self._string_to_int(tag.get('maxlength', '20'))
length = random.randint(minlen, maxlen)
charset = range(min_value, max_value + 1)
ret_list = [chr(charset[int(random.random() * len(charset))])
for _ in range(length)]
return ''.join(ret_list)
def _generate_html_string(self, tag):
return _escape(self._generate_string(tag), quote=True)
def _generate_hex(self, tag):
"""Generates a single hex digit."""
digit = random.randint(0, 15)
if 'up' in tag:
return '%X' % digit
else:
return '%x' % digit
def _generate_import(self, tag):
"""Expands a symbol from another (imported) grammar."""
if 'from' not in tag:
raise GrammarError('import tag without from attribute')
grammarname = tag['from']
if grammarname not in self._imports:
raise GrammarError('unknown import ' + grammarname)
grammar = self._imports[grammarname]
if 'symbol' in tag:
symbol = tag['symbol']
return grammar.generate_symbol(symbol)
else:
return grammar.generate_root()
def _generate_lines(self, tag):
"""Generates a given number of lines of code."""
if 'count' not in tag:
raise GrammarError('lines tag without count attribute')
num_lines = self._string_to_int(tag['count'])
return self._generate_code(num_lines)
def _generate_code(self, num_lines, initial_variables=[], last_var=0):
"""Generates a given number of lines of code."""
context = {
'lastvar': last_var,
'lines': [],
'variables': {},
'interesting_lines': [],
'force_var_reuse': False
}
for v in initial_variables:
self._add_variable(v['name'], v['type'], context)
self._add_variable('document', 'Document', context)
self._add_variable('window', 'Window', context)
while len(context['lines']) < num_lines:
tmp_context = context.copy()
try:
if (random.random() < self._interesting_line_prob) and (len(tmp_context['interesting_lines']) > 0):
tmp_context['force_var_reuse'] = True
lineno = random.choice(tmp_context['interesting_lines'])
else:
lineno = random.choice(self._all_nonhelper_lines)
creator = self._creators['line'][lineno]
self._expand_rule('line', creator, tmp_context, 0, False)
context = tmp_context
except RecursionError as e:
print('Warning: ' + str(e))
if not self._line_guard:
guarded_lines = context['lines']
else:
guarded_lines = []
for line in context['lines']:
guarded_lines.append(self._line_guard.replace('<line>', line))
return '\n'.join(guarded_lines)
def _exec_function(self, function_name, attributes, context, ret_val):
"""Executes user-defined python code."""
if function_name not in self._functions:
raise GrammarError('Unknown function ' + function_name)
compiled_function = self._functions[function_name]
args = {
'attributes': attributes,
'context': context,
'ret_val': ret_val
}
# pylint: disable=exec-used
try:
exec(compiled_function, args)
except Exception as e:
raise GrammarError('Error in user-defined function: %s' % str(e))
return args['ret_val']
def _select_creator(self, symbol, recursion_depth, force_nonrecursive):
"""Selects the creator for the given symbol.
The creator is based on probabilities specified in the grammar or
based on uniform distribution if no probabilities are specified.
Args:
symbol: The name of the symbol to get the creator rules for.
recursion_depth: Current recursion depth
force_nonrecursive: if True, only creators which are marked as
'nonrecursive' will be used (if available)
Returns:
A dictionary describing a rule that can create a given symbol.
Raises:
RecursionError: If maximum recursion level was reached.
GrammarError: If there are no rules that create a given type.
"""
# Do we even know how to create this type?
if symbol not in self._creators:
raise GrammarError('No creators for type ' + symbol)
if recursion_depth >= self._recursion_max:
raise RecursionError(
'Maximum recursion level reached while creating '
'object of type' + symbol
)
elif force_nonrecursive and symbol in self._nonrecursive_creators:
creators = self._nonrecursive_creators[symbol]
cdf = self._nonrecursivecreator_cdfs[symbol]
else:
creators = self._creators[symbol]
cdf = self._creator_cdfs[symbol]
if not cdf:
# Uniform distribution, faster
return creators[random.randint(0, len(creators) - 1)]
# Select a creator according to the cdf
idx = bisect.bisect_left(cdf, random.random(), 0, len(cdf))
return creators[idx]
def _generate(self, symbol, context,
recursion_depth=0, force_nonrecursive=False):
"""Generates a user-defined symbol.
Selects a rule for the given symbol and resolves the right-hand side
of the rule.
Args:
symbol: The name of the symbol that is being resolved.
context: dictionary consisting of:
'lastvar': Index of last variable created.
'lines': Generated lines of code
(for programming language generation).
'variables': A dictionary containing the names of all
variables created so far.
recursion_depth: Current recursion depth
force_nonrecursive: Whether to force the use of only
non-recursive rules.
Returns:
A string containing the expansion of the symbol.
Raises:
GrammarError: If grammar description is incorrect causing
some rules being impossible to resolve
RecursionError: If maximum recursion level was reached.
"""
# print symbol
# print 'Expanding ' + symbol + ' in depth ' + str(recursion_depth)
force_var_reuse = context['force_var_reuse']
# Check if we already have a variable of the given type.
if (symbol in context['variables'] and
symbol not in _NONINTERESTING_TYPES):
# print symbol + ':' + str(len(context['variables'][symbol])) + ':' + str(force_var_reuse)
if (force_var_reuse or
random.random() < self._var_reuse_prob or
len(context['variables'][symbol]) > self._max_vars_of_same_type):
# print 'reusing existing var of type ' + symbol
context['force_var_reuse'] = False
variables = context['variables'][symbol]
return variables[random.randint(0, len(variables) - 1)]
# print 'Not reusing existing var of type ' + symbol
creator = self._select_creator(
symbol,
recursion_depth,
force_nonrecursive
)
return self._expand_rule(
symbol,
creator,
context,
recursion_depth,
force_nonrecursive
)
def _expand_rule(self, symbol, rule, context,
recursion_depth, force_nonrecursive):
"""Expands a given rule.
Iterates through all the elements on right-hand side of the rule,
replacing them with their string representations or recursively
calling _Generate() for other non-terminal symbols.
Args:
symbol: The name of the symbol that is being resolved.
rule: production rule that will be used to expand the symbol.
context: dictionary consisting of:
'lastvar': Index of last variable created.
'lines': Generated lines of code
(for programming language generation).
'variables': A dictionary containing the names of all
variables created so far.
recursion_depth: Current recursion depth
force_nonrecursive: Whether to force the use of only
non-recursive rules.
Returns:
A string containing the expansion of the symbol.
Raises:
GrammarError: If grammar description is incorrect causing
some rules being impossible to resolve
RecursionError: If maximum recursion level was reached.
"""
variable_ids = {}
# Resolve the right side of the rule
new_vars = []
ret_vars = []
ret_parts = []
for part in rule['parts']:
if 'id' in part:
if part['id'] in variable_ids:
ret_parts.append(variable_ids[part['id']])
continue
if part['type'] == 'text':
expanded = part['text']
elif rule['type'] == 'code' and 'new' in part:
var_type = part['tagname']
context['lastvar'] += 1
var_name = self._var_format % context['lastvar']
new_vars.append({'name': var_name, 'type': var_type})
# print var_name
# print context['lastvar']
if var_type == symbol:
ret_vars.append(var_name)
expanded = '/* newvar{' + var_name + ':' + var_type + '} */ var ' + var_name
elif part['tagname'] in self._constant_types:
expanded = self._constant_types[part['tagname']]
elif part['tagname'] in self._built_in_types:
expanded = self._built_in_types[part['tagname']](part)
elif part['tagname'] == 'call':
if 'function' not in part:
raise GrammarError('Call tag without a function attribute')
expanded = self._exec_function(
part['function'],
part,
context,
''
)
elif (part['tagname'] == 'any') and 'variables' in context:
expanded = self._get_any_var(context);
else:
try:
expanded = self._generate(
part['tagname'],
context,
recursion_depth + 1,
force_nonrecursive
)
except RecursionError as e:
if not force_nonrecursive:
expanded = self._generate(
part['tagname'],
context,
recursion_depth + 1,
True
)
else:
raise RecursionError(e)
if 'id' in part:
variable_ids[part['id']] = expanded
if 'beforeoutput' in part:
expanded = self._exec_function(
part['beforeoutput'],
part,
context,
expanded
)
ret_parts.append(expanded)
# Add all newly created variables to the context
additional_lines = []
for v in new_vars:
if v['type'] not in _NONINTERESTING_TYPES:
self._add_variable(v['name'], v['type'], context)
additional_lines.append("if (!" + v['name'] + ") { " + v['name'] + " = GetVariable(fuzzervars, '" + v['type'] + "'); } else { " + self._get_variable_setters(v['name'], v['type']) + " }")
# Return the result.
# In case of 'ordinary' grammar rules, return the filled rule.
# In case of code, return just the variable name
# and update the context
filed_rule = ''.join(ret_parts)
if rule['type'] == 'grammar':
return filed_rule
else:
context['lines'].append(filed_rule)
context['lines'].extend(additional_lines)
if symbol == 'line':
return filed_rule
else:
return ret_vars[random.randint(0, len(ret_vars) - 1)]
def generate_root(self):
"""Expands root symbol."""
if self._root:
context = {
'lastvar': 0,
'lines': [],
'variables': {},
'force_var_reuse': False
}
return self._generate(self._root, context, 0)
else:
print('Error: No root element defined.')
return ''
def generate_symbol(self, name):
"""Expands a symbol whose name is given as an argument."""
context = {
'lastvar': 0,
'lines': [],
'variables': {},
'force_var_reuse': False
}
return self._generate(name, context, 0)
def _get_cdf(self, symbol, creators):
"""Computes a probability function for a given creator array."""
uniform = True
probabilities = []
defined = []
cdf = []
if symbol == 'line':
# We can't currently set line probability
return []
# Get probabilities for individual rule
for creator in creators:
if creator['type'] == 'grammar':
create_tag = creator['creates']
else:
# For type=code multiple variables may be created
for tag in creator['creates']:
if tag['tagname'] == symbol:
create_tag = tag
break
if 'p' in create_tag:
probabilities.append(float(create_tag['p']))
defined.append(True)
uniform = False
else:
probabilities.append(0)
defined.append(False)
if uniform:
return []
# Compute probabilities for rules in which they are not
# explicitly defined
# Also normalize probabilities in cases where sum > 1
nondef_value = 0
norm_factor = 1.0
p_sum = sum(probabilities)
nondef_count = defined.count(False)
if p_sum > 1 or nondef_count == 0:
norm_factor = 1.0 / p_sum
else:
nondef_value = (1 - p_sum) / nondef_count
p_sum = 0
for i in range(len(probabilities)):
p = probabilities[i]
if not defined[i]:
p = nondef_value
else:
p *= norm_factor
p_sum += p
cdf.append(p_sum)
return cdf
def _normalize_probabilities(self):
"""Preprocessess probabilities for production rules.
Creates CDFs (cumulative distribution functions) and normalizes
probabilities in the [0,1] range for all creators. This is a
preprocessing function that makes subsequent creator selection
based on probability easier.
"""
for symbol, creators in self._creators.items():
cdf = self._get_cdf(symbol, creators)
self._creator_cdfs[symbol] = cdf
for symbol, creators in self._nonrecursive_creators.items():
cdf = self._get_cdf(symbol, creators)
self._nonrecursivecreator_cdfs[symbol] = cdf
def _parse_tag_and_attributes(self, string):
"""Extracts tag name and attributes from a string."""
parts = string.split()
if len(parts) < 1:
raise GrammarError('Empty tag encountered')
ret = {'type': 'tag'}
if len(parts) > 1 and parts[0] == 'new':
ret['tagname'] = parts[1]
ret['new'] = 'true'
attrstart = 2
else:
ret['tagname'] = parts[0]
attrstart = 1
for i in range(attrstart, len(parts)):
attrparts = parts[i].split('=')
if len(attrparts) == 2:
ret[attrparts[0]] = attrparts[1]
elif len(attrparts) == 1:
ret[attrparts[0]] = True
else:
raise GrammarError('Error parsing tag ' + string)
return ret
def _parse_code_line(self, line, helper_lines=False):
"""Parses a rule for generating code."""
rule = {
'type': 'code',
'parts': [],
'creates': []
}
# Splits the line into constant parts and tags. For example
# "foo<bar>baz" would be split into three parts, "foo", "bar" and "baz"
# Every other part is going to be constant and every other part
# is going to be a tag, always starting with a constant. Empty
# spaces between tags/beginning/end are not a problem because
# then empty strings will be returned in corresponding places,
# for example "<foo><bar>" gets split into "", "foo", "", "bar", ""
rule_parts = re.split(r'<([^>)]*)>', line)
for i in range(0, len(rule_parts)):
if i % 2 == 0:
if rule_parts[i]:
rule['parts'].append({
'type': 'text',
'text': rule_parts[i]
})
else:
parsedtag = self._parse_tag_and_attributes(rule_parts[i])
rule['parts'].append(parsedtag)
if 'new' in parsedtag:
rule['creates'].append(parsedtag)
for tag in rule['creates']:
tag_name = tag['tagname']
if tag_name in _NONINTERESTING_TYPES:
continue
if tag_name in self._creators:
self._creators[tag_name].append(rule)
else:
self._creators[tag_name] = [rule]
if 'nonrecursive' in tag:
if tag_name in self._nonrecursive_creators:
self._nonrecursive_creators[tag_name].append(rule)
else:
self._nonrecursive_creators[tag_name] = [rule]
if not helper_lines:
if 'line' in self._creators:
self._creators['line'].append(rule)
else:
self._creators['line'] = [rule]
self._all_rules.append(rule)
def _parse_grammar_line(self, line):
"""Parses a grammar rule."""
# Check if the line matches grammar rule pattern (<tagname> = ...).
match = re.match(r'^<([^>]*)>\s*=\s*(.*)$', line)
if not match:
raise GrammarError('Error parsing rule ' + line)
# Parse the line to create a grammar rule.
rule = {
'type': 'grammar',
'creates': self._parse_tag_and_attributes(match.group(1)),
'parts': []
}
rule_parts = re.split(r'<([^>)]*)>', match.group(2))
rule['recursive'] = False
# Splits the line into constant parts and tags. For example
# "foo<bar>baz" would be split into three parts, "foo", "bar" and "baz"
# Every other part is going to be constant and every other part
# is going to be a tag, always starting with a constant. Empty
# spaces between tags/beginning/end are not a problem because
# then empty strings will be returned in corresponding places,
# for example "<foo><bar>" gets split into "", "foo", "", "bar", ""
for i in range(0, len(rule_parts)):
if i % 2 == 0:
if rule_parts[i]:
rule['parts'].append({
'type': 'text',
'text': rule_parts[i]
})
else:
parsedtag = self._parse_tag_and_attributes(rule_parts[i])
rule['parts'].append(parsedtag)
if parsedtag['tagname'] == rule['creates']['tagname']:
rule['recursive'] = True
# Store the rule in appropriate sets.
create_tag_name = rule['creates']['tagname']
if create_tag_name in self._creators:
self._creators[create_tag_name].append(rule)
else:
self._creators[create_tag_name] = [rule]
if 'nonrecursive' in rule['creates']:
if create_tag_name in self._nonrecursive_creators:
self._nonrecursive_creators[create_tag_name].append(rule)
else:
self._nonrecursive_creators[create_tag_name] = [rule]
self._all_rules.append(rule)
if 'root' in rule['creates']:
self._root = create_tag_name
def _remove_comments(self, line):
"""Removes comments and trims the line."""
if '#' in line:
cleanline = line[:line.index('#')].strip()
else:
cleanline = line.strip()
return cleanline
def _fix_idents(self, source):
"""Fixes indentation in user-defined functions.
Exec requires zero first-level indentation. This function fixes
it by finding a minimum indentation in code and removing it
from all lines.
Args:
source: Python source code, possibly with > 0 min indentation.
Returns:
Source code with 0 first-level indentation.
"""
# Tab is 8 spaces according to Python documentation.
lines = source.replace('\t', ' ' * 8).splitlines()
lines_without_blanks = [line for line in lines if line.strip()]
indent_to_remove = min([len(line) - len(line.strip())
for line in lines_without_blanks])
if indent_to_remove == 0:
return source
output = []
for ln in lines:
if ln.strip():
ln = ln[indent_to_remove:]
output.append(ln)
return '\n'.join(output)
def _save_function(self, name, source):
source = self._fix_idents(source)
try:
compiled_fn = compile(source, name, 'exec')
except (SyntaxError, TypeError) as e:
raise GrammarError('Error in user-defined function: %s' % str(e))
self._functions[name] = compiled_fn
def _set_variable_format(self, var_format):
"""Sets variable format for programming language generation."""
self._var_format = var_format.strip()
return 0
def _set_line_guard(self, lineguard):
"""Sets a guard block for programming language generation."""
self._line_guard = lineguard
def _set_recursion_depth(self, depth_str):
"""Sets maximum recursion depth."""
depth_str = depth_str.strip()
if depth_str.isdigit():
self._recursion_max = int(depth_str)
else:
raise GrammarError('Argument to max_recursion is not an integer')
def _set_var_reuse_probability(self, p_str):
p_str = p_str.strip()
try:
p = float(p_str)
except ValueError:
raise GrammarError('Argument to var_reuse_prob is not a number')
self._var_reuse_prob = p
def _set_extends(self, p_str):
args = p_str.strip().split(' ')
objectname = args[0]
parentname = args[1]
if objectname not in self._inheritance:
self._inheritance[objectname] = []
# print(objectname, parentname)
self._inheritance[objectname].append(parentname)
def _import_grammar(self, filename):
"""Imports a grammar from another file."""
basename = os.path.basename(filename)
path = os.path.join(self._definitions_dir, filename)
subgrammar = Grammar()
num_errors = subgrammar.parse_from_file(path)
if num_errors:
raise GrammarError('There were errors when parsing ' + filename)
self._imports[basename] = subgrammar
def add_import(self, name, grammar):
"""Adds a grammar that can then be used from <import> tags.
In case the grammar is already loaded this can be faster than
using the !import directive which parses the file again.
Args:
name: Name under which to import the grammar.
grammar: The grammar object to use as import
"""
self._imports[name] = grammar
def _include_from_string(self, grammar_str):
in_code = False
helper_lines = False
in_function = False
num_errors = 0
lines = grammar_str.split('\n')
for line in lines:
if not in_function:
cleanline = self._remove_comments(line)
if not cleanline:
continue
else:
cleanline = line
# Process special commands
match = re.match(r'^!([a-z_]+)\s*(.*)$', cleanline)
if match:
command = match.group(1)
params = match.group(2)
if command in self._command_handlers:
self._command_handlers[command](params)
elif command == 'begin' and params == 'lines':
in_code = True
helper_lines = False
elif command == 'begin' and params == 'helperlines':
in_code = True
helper_lines = True
elif command == 'end' and params in ('lines', 'helperlines'):
if in_code:
in_code = False
elif command == 'begin' and params.startswith('function'):
match = re.match(r'^function\s*([a-zA-Z._0-9]+)$', params)
if match and not in_function:
function_name = match.group(1)
function_body = ''
in_function = True
else:
print('Error parsing line ' + line)
num_errors += 1
elif command == 'end' and params == 'function':
if in_function:
in_function = False
self._save_function(function_name, function_body)
else:
print('Unknown command: ' + command)
num_errors += 1
continue
try:
if in_function:
function_body += cleanline + '\n'
elif in_code:
self._parse_code_line(cleanline, helper_lines)
else:
self._parse_grammar_line(cleanline)
except GrammarError:
print('Error parsing line ' + line)
num_errors += 1
return num_errors
def _include_from_file(self, filename):
try:
f = open(os.path.join(self._definitions_dir,
filename
))
content = f.read()
f.close()
except IOError:
print('Error reading ' + filename)
return 1
return self.parse_from_string(content)
def parse_from_string(self, grammar_str):
"""Parses grammar rules from string.
Splits the string into lines, parses the lines and loads grammar rules.
See readme for the rule syntax.
Args:
grammar_str: String containing the grammar.
Returns:
Number of errors encountered during the parsing.
"""
errors = self._include_from_string(grammar_str)
if errors:
return errors
self._normalize_probabilities()
self._compute_interesting_indices()
return 0
def parse_from_file(self, filename):
"""Parses grammar from file.
Opens a text file, parses it and loads the grammar rules within.
See readme for the rule syntax. Note that grammar
files can include other grammar files using !import command.
Args:
filename: path to the file with grammar rules.
Returns:
Number of errors encountered during the parsing.
"""
try:
f = open(filename)
content = f.read()
f.close()
except IOError:
print('Error reading ' + filename)
return 1
self._definitions_dir = os.path.dirname(filename)
return self.parse_from_string(content)
def _compute_interesting_indices(self):
# select interesting lines for each variable type
if 'line' not in self._creators:
return
for i in range(len(self._creators['line'])):
self._all_nonhelper_lines.append(i)
rule = self._creators['line'][i]
for part in rule['parts']:
if part['type'] == 'text':
continue