ArithmeticRightRecursiveCompiler.py 9.51 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
#!/usr/bin/python3

#######################################################################
#
# SYMBOLS SECTION - Can be edited. Changes will be preserved.
#
#######################################################################


import collections
from functools import partial
import os
import sys

15
sys.path.append(r'/home/eckhart/Entwicklung/DHParser')
16
17
18
19
20
21
22
23
24
25

try:
    import regex as re
except ImportError:
    import re
from DHParser import logging, is_filename, load_if_file, \
    Grammar, Compiler, nil_preprocessor, PreprocessorToken, Whitespace, DropWhitespace, \
    Lookbehind, Lookahead, Alternative, Pop, Token, DropToken, Synonym, AllOf, SomeOf, \
    Unordered, Option, NegativeLookbehind, OneOrMore, RegExp, Retrieve, Series, Capture, \
    ZeroOrMore, Forward, NegativeLookahead, Required, mixin_comment, compile_source, \
26
    grammar_changed, last_value, counterpart, accumulate, PreprocessorFunc, is_empty, \
27
28
29
    Node, TransformationFunc, TransformationDict, transformation_factory, traverse, \
    remove_children_if, move_adjacent, normalize_whitespace, is_anonymous, matches_re, \
    reduce_single_child, replace_by_single_child, replace_or_reduce, remove_whitespace, \
30
    remove_empty, remove_tokens, flatten, is_insignificant_whitespace, \
Eckhart Arnold's avatar
Eckhart Arnold committed
31
32
    collapse, collapse_if, replace_content, WHITESPACE_PTYPE, TOKEN_PTYPE, \
    remove_nodes, remove_content, remove_brackets, change_tag_name, remove_anonymous_tokens, \
33
34
35
    keep_children, is_one_of, not_one_of, has_content, apply_if, remove_first, remove_last, \
    remove_anonymous_empty, keep_nodes, traverse_locally, strip, lstrip, rstrip, \
    replace_content, replace_content_by, forbid, assert_content, remove_infix_operator, \
36
    error_on, recompile_grammar, left_associative, lean_left, GLOBALS
37
38
39
40
41
42
43
44


#######################################################################
#
# PREPROCESSOR SECTION - Can be edited. Changes will be preserved.
#
#######################################################################

45
def ArithmeticRightRecursivePreprocessor(text):
46
47
48
    return text, lambda i: i

def get_preprocessor() -> PreprocessorFunc:
49
    return ArithmeticRightRecursivePreprocessor
50
51
52
53
54
55
56
57


#######################################################################
#
# PARSER SECTION - Don't edit! CHANGES WILL BE OVERWRITTEN!
#
#######################################################################

58
59
class ArithmeticRightRecursiveGrammar(Grammar):
    r"""Parser for an ArithmeticRightRecursive source file.
60
61
    """
    expression = Forward()
Eckhart Arnold's avatar
Eckhart Arnold committed
62
    term = Forward()
63
    source_hash__ = "de949295be0b4c5b67cee8aa9cd1a73e"
64
65
66
67
68
69
70
    static_analysis_pending__ = [True]
    parser_initialization__ = ["upon instantiation"]
    resume_rules__ = {}
    COMMENT__ = r'#.*'
    WHITESPACE__ = r'\s*'
    WSP_RE__ = mixin_comment(whitespace=WHITESPACE__, comment=COMMENT__)
    dwsp__ = DropWhitespace(WSP_RE__)
71
72
73
74
75
76
77
    VARIABLE = Series(RegExp('[A-Za-z]'), dwsp__)
    NUMBER = Series(RegExp('(?:0|(?:[1-9]\\d*))(?:\\.\\d+)?'), dwsp__)
    NEGATIVE = RegExp('[-]')
    POSITIVE = RegExp('[+]')
    group = Series(Series(DropToken("("), dwsp__), expression, Series(DropToken(")"), dwsp__))
    sign = Alternative(POSITIVE, NEGATIVE)
    factor = Series(Option(sign), Alternative(NUMBER, VARIABLE, group))
78
    div = Series(factor, Series(DropToken("/"), dwsp__), term)
79
    mul = Series(factor, Series(DropToken("*"), dwsp__), term)
80
81
82
83
    term.set(Alternative(mul, div, factor))
    sub = Series(term, Series(DropToken("-"), dwsp__), expression)
    add = Series(term, Series(DropToken("+"), dwsp__), expression)
    expression.set(Alternative(add, sub, term))
84
85
    root__ = expression
    
86
87
def get_grammar() -> ArithmeticRightRecursiveGrammar:
    """Returns a thread/process-exclusive ArithmeticRightRecursiveGrammar-singleton."""
88
    try:
89
        grammar = GLOBALS.ArithmeticRightRecursive_00000001_grammar_singleton
90
    except AttributeError:
91
        GLOBALS.ArithmeticRightRecursive_00000001_grammar_singleton = ArithmeticRightRecursiveGrammar()
92
        if hasattr(get_grammar, 'python_src__'):
93
94
            GLOBALS.ArithmeticRightRecursive_00000001_grammar_singleton.python_src__ = get_grammar.python_src__
        grammar = GLOBALS.ArithmeticRightRecursive_00000001_grammar_singleton
95
96
97
98
99
100
101
102
103
    return grammar


#######################################################################
#
# AST SECTION - Can be edited. Changes will be preserved.
#
#######################################################################

104
105
106
107
108
ArithmeticRightRecursive_AST_transformation_table = {
    # AST Transformations for the ArithmeticRightRecursive-grammar
    "sign, factor, term, expression": [replace_by_single_child],
    "add, sub": [lean_left({'sub', 'add'})],
    "mul, div": [lean_left({'mul', 'div'})],
109
110
111
}


112
113
114
115
116
117
118
119
120
121
122
123
124
125
def CreateArithmeticRightRecursiveTransformer() -> TransformationFunc:
    """Creates a transformation function that does not share state with other
    threads or processes."""
    def transformation_func(cst: Node, pass_1, pass_2):
        """Special transformation function requires two passes, because
        otherwise elimination of grouping nodes (pass 2) would interfere
        with the adjustment of the tree structure to the left-associativity
        of the `add`, `sub`, `mul` and `div` operators."""
        traverse(cst, pass_1)
        traverse(cst, pass_2)
    return partial(transformation_func,
                   pass_1=ArithmeticRightRecursive_AST_transformation_table.copy(),
                   pass_2={'group': [replace_by_single_child]}.copy())

126
127

def get_transformer() -> TransformationFunc:
128
    """Returns a thread/process-exclusive transformation function."""
129
    try:
130
        transformer = GLOBALS.ArithmeticRightRecursive_00000001_transformer_singleton
131
    except AttributeError:
132
133
134
        GLOBALS.ArithmeticRightRecursive_00000001_transformer_singleton = \
            CreateArithmeticRightRecursiveTransformer()
        transformer = GLOBALS.ArithmeticRightRecursive_00000001_transformer_singleton
135
136
137
138
139
140
141
142
143
    return transformer


#######################################################################
#
# COMPILER SECTION - Can be edited. Changes will be preserved.
#
#######################################################################

144
145
class ArithmeticRightRecursiveCompiler(Compiler):
    """Compiler for the abstract-syntax-tree of a ArithmeticRightRecursive source file.
146
147
148
    """

    def __init__(self):
149
        super(ArithmeticRightRecursiveCompiler, self).__init__()
150
151
152
153
154
155
156

    def _reset(self):
        super()._reset()
        # initialize your variables here, not in the constructor!
    def on_expression(self, node):
        return self.fallback_compiler(node)

157
158
159
160
161
162
    # def on_add(self, node):
    #     return node

    # def on_sub(self, node):
    #     return node

163
164
165
    # def on_term(self, node):
    #     return node

166
167
168
169
170
171
    # def on_mul(self, node):
    #     return node

    # def on_div(self, node):
    #     return node

172
173
174
    # def on_factor(self, node):
    #     return node

175
176
177
178
179
180
181
182
183
184
185
186
    # def on_sign(self, node):
    #     return node

    # def on_group(self, node):
    #     return node

    # def on_POSITIVE(self, node):
    #     return node

    # def on_NEGATIVE(self, node):
    #     return node

187
188
189
190
191
192
193
    # def on_NUMBER(self, node):
    #     return node

    # def on_VARIABLE(self, node):
    #     return node


194
195
def get_compiler() -> ArithmeticRightRecursiveCompiler:
    """Returns a thread/process-exclusive ArithmeticRightRecursiveCompiler-singleton."""
196
    try:
197
        compiler = GLOBALS.ArithmeticRightRecursive_00000001_compiler_singleton
198
    except AttributeError:
199
200
        GLOBALS.ArithmeticRightRecursive_00000001_compiler_singleton = ArithmeticRightRecursiveCompiler()
        compiler = GLOBALS.ArithmeticRightRecursive_00000001_compiler_singleton
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
    return compiler


#######################################################################
#
# END OF DHPARSER-SECTIONS
#
#######################################################################


def compile_src(source, log_dir=''):
    """Compiles ``source`` and returns (result, errors, ast).
    """
    with logging(log_dir):
        compiler = get_compiler()
        cname = compiler.__class__.__name__
        result_tuple = compile_source(source, get_preprocessor(),
                                      get_grammar(),
                                      get_transformer(), compiler)
    return result_tuple


if __name__ == "__main__":
    # recompile grammar if needed
    grammar_path = os.path.abspath(__file__).replace('Compiler.py', '.ebnf')
    if os.path.exists(grammar_path):
        if not recompile_grammar(grammar_path, force=False,
                                  notify=lambda:print('recompiling ' + grammar_path)):
            error_file = os.path.basename(__file__).replace('Compiler.py', '_ebnf_ERRORS.txt')
            with open(error_file, encoding="utf-8") as f:
                print(f.read())
            sys.exit(1)
    else:
        print('Could not check whether grammar requires recompiling, '
              'because grammar was not found at: ' + grammar_path)

    if len(sys.argv) > 1:
        # compile file
        file_name, log_dir = sys.argv[1], ''
        if file_name in ['-d', '--debug'] and len(sys.argv) > 2:
            file_name, log_dir = sys.argv[2], 'LOGS'
        result, errors, ast = compile_src(file_name, log_dir)
        if errors:
            cwd = os.getcwd()
            rel_path = file_name[len(cwd):] if file_name.startswith(cwd) else file_name
            for error in errors:
                print(rel_path + ':' + str(error))
            sys.exit(1)
        else:
            print(result.as_xml() if isinstance(result, Node) else result)
    else:
252
        print("Usage: ArithmeticRightRecursiveCompiler.py [FILENAME]")