test_syntaxtree.py 5.79 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#!/usr/bin/python3

"""test_syntaxtree.py - test of syntaxtree-module of DHParser 
                             
Author: Eckhart Arnold <arnold@badw.de>

Copyright 2017 Bavarian Academy of Sciences and Humanities

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.
"""

22
import copy
23
import sys
Eckhart Arnold's avatar
Eckhart Arnold committed
24
25
sys.path.extend(['../', './'])

26
from DHParser.toolkit import compact_sexpr, logging
27
from DHParser.syntaxtree import traverse, reduce_single_child, \
28
    replace_by_single_child, flatten, remove_expendables, TOKEN_PTYPE
29
from DHParser.testing import mock_syntax_tree
30
from DHParser.ebnf import get_ebnf_grammar, get_ebnf_transformer, get_ebnf_compiler
31
from DHParser.dsl import parser_factory
32

33

34
class MockParser:
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
    def __init__(self, name=''):
        self.name = name

    def __str__(self):
        return self.name or self.__class__.__name__

    def __call__(self, text):
        return None, text


class TestSExpr:
    """
    Tests for S-expression handling.
    """
    def test_compact_sexpr(self):
        assert compact_sexpr("(a\n    (b\n        c\n    )\n)\n") == "(a (b c))"

52
    def test_mock_syntax_tree(self):
53
        sexpr = '(a (b c) (d e) (f (g h)))'
54
        tree = mock_syntax_tree(sexpr)
55
56
57
58
59
60
61
62
63
64
65
66
67
68
        assert compact_sexpr(tree.as_sexpr().replace('"', '')) == sexpr

        # test different quotation marks
        sexpr = '''(a (b """c""" 'k' "l") (d e) (f (g h)))'''
        sexpr_stripped = '(a (b c k l) (d e) (f (g h)))'
        tree = mock_syntax_tree(sexpr)
        assert compact_sexpr(tree.as_sexpr().replace('"', '')) == sexpr_stripped

        sexpr_clean = '(a (b "c" "k" "l") (d "e") (f (g "h")))'
        tree = mock_syntax_tree(sexpr_clean)
        assert compact_sexpr(tree.as_sexpr()) == sexpr_clean

        tree = mock_syntax_tree(sexpr_stripped)
        assert compact_sexpr(tree.as_sexpr()) == '(a (b "c k l") (d "e") (f (g "h")))'
69

70
71
72
73
74
    def test_mock_syntax_tree_with_classes(self):
        sexpr = '(a:class1 (b:class2 x) (:class3 y) (c z))'
        tree = mock_syntax_tree(sexpr)
        assert tree.tag_name == 'a'
        assert tree.result[0].tag_name == 'b'
75
        assert tree.result[1].tag_name == ':class3'
76
        assert tree.result[2].tag_name == 'c'
77
78
79
80
81
82
83

class TestNode:
    """
    Tests for class Node 
    """
    def setup(self):
        self.unique_nodes_sexpr = '(a (b c) (d e) (f (g h)))'
84
        self.unique_tree = mock_syntax_tree(self.unique_nodes_sexpr)
85
        self.recurring_nodes_sexpr = '(a (b x) (c (d e) (b y)))'
86
        self.recurr_tree = mock_syntax_tree(self.recurring_nodes_sexpr)
87
88
89
90
91
92
93
94
95
96
97
98
99

    def test_str(self):
        assert str(self.unique_tree) == "ceh"
        assert str(self.recurr_tree) == "xey"

    def test_find(self):
        found = list(self.unique_tree.find(lambda nd: not nd.children and nd.result == "e"))
        assert len(found) == 1
        assert found[0].result == 'e'
        found = list(self.recurr_tree.find(lambda nd: nd.tag_name == 'b'))
        assert len(found) == 2
        assert found[0].result == 'x' and found[1].result == 'y'

100
    def test_equality1(self):
101
102
103
        assert self.unique_tree == self.unique_tree
        assert self.recurr_tree != self.unique_tree
        assert mock_syntax_tree('(a (b c))') != mock_syntax_tree('(a (b d))')
104
105
106
107
108
109
        assert mock_syntax_tree('(a (b c))') == mock_syntax_tree('(a (b c))')

    def test_equality2(self):
        ebnf = 'term = term ("*"|"/") factor | factor\nfactor = /[0-9]+/~'
        att  = {"term": [replace_by_single_child, flatten],
                "factor": [remove_expendables, reduce_single_child],
110
111
                (TOKEN_PTYPE): [remove_expendables, reduce_single_child],
                "?": [remove_expendables, replace_by_single_child]}
112
113
114
        parser = parser_factory(ebnf)()
        tree = parser("20 / 4 * 3")
        traverse(tree, att)
115
        compare_tree = mock_syntax_tree("(term (term (factor 20) (:Token /) (factor 4)) (:Token *) (factor 3))")
116
        assert tree == compare_tree
117

118
119
120
121
122
123
124
    def test_copy(self):
        cpy = copy.deepcopy(self.unique_tree)
        assert cpy == self.unique_tree
        assert cpy.result[0].result != "epsilon" # just to make sure...
        cpy.result[0].result = "epsilon"
        assert cpy != self.unique_tree

125
126
127
128
129
130
131
    def test_copy2(self):
        # test if Node.__deepcopy__ goes sufficiently deep for ast-
        # transformation and compiling to perform correctly after copy
        ebnf = 'term = term ("*"|"/") factor | factor\nfactor = /[0-9]+/~'
        parser = get_ebnf_grammar()
        transform = get_ebnf_transformer()
        compiler = get_ebnf_compiler()
Eckhart Arnold's avatar
Eckhart Arnold committed
132
        tree = parser(ebnf)
133
134
135
136
137
138
139
140
141
142
143
144
145
146
        tree_copy = copy.deepcopy(tree)
        transform(tree_copy)
        res1 = compiler(tree_copy)
        t2 = copy.deepcopy(tree_copy)
        res2 = compiler(t2)
        assert res1 == res2
        tree_copy = copy.deepcopy(tree)
        transform(tree_copy)
        res3 = compiler(tree_copy)
        assert res3 == res2
        transform(tree)
        res4 = compiler(tree)
        assert res4 == res3

147

148
class TestErrorHandling:
149
    def test_error_flag_propagation(self):
150
        tree = mock_syntax_tree('(a (b c) (d (e (f (g h)))))')
151
152
153
154
155
156
157
158
159
160

        def find_h(node):
            if node.result == "h":
                node.add_error("an error deep inside the syntax tree")

        assert not tree.error_flag
        traverse(tree, {"*": find_h})
        assert tree.error_flag


161
if __name__ == "__main__":
162
    from run import runner
163
    runner("", globals())