test_syntaxtree.py 6.01 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.error import Error
27
from DHParser.syntaxtree import Node, mock_syntax_tree, TOKEN_PTYPE
eckhart's avatar
eckhart committed
28
29
from DHParser.transform import traverse, content_from_child, \
    replace_by_child, flatten, remove_expendables
30
from DHParser.ebnf import get_ebnf_grammar, get_ebnf_transformer, get_ebnf_compiler
31
from DHParser.dsl import grammar_provider
32

33

34
35
36
37
38
39
40
41
42
43
44
45
class TestMockSyntaxTree:
    def test_mock_syntax_tree(self):
        tree = mock_syntax_tree('(a (b c))')
        tree = mock_syntax_tree('(a i\nj\nk)')
        try:
            tree = mock_syntax_tree('a b c')
            assert False, "mock_syntax_tree() should raise a ValueError " \
                          "if argument is not a tree!"
        except ValueError:
            pass


46
47
48
49
50
51
class TestNode:
    """
    Tests for class Node 
    """
    def setup(self):
        self.unique_nodes_sexpr = '(a (b c) (d e) (f (g h)))'
52
        self.unique_tree = mock_syntax_tree(self.unique_nodes_sexpr)
53
        self.recurring_nodes_sexpr = '(a (b x) (c (d e) (b y)))'
54
        self.recurr_tree = mock_syntax_tree(self.recurring_nodes_sexpr)
55
56
57
58
59
60
61
62
63
64
65
66
67

    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'

68
    def test_equality1(self):
69
70
71
        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))')
72
73
74
75
        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]+/~'
eckhart's avatar
eckhart committed
76
77
78
79
        att  = {"term": [replace_by_child, flatten],
                "factor": [remove_expendables, content_from_child],
                (TOKEN_PTYPE): [remove_expendables, content_from_child],
                "?": [remove_expendables, replace_by_child]}
80
        parser = grammar_provider(ebnf)()
81
82
        tree = parser("20 / 4 * 3")
        traverse(tree, att)
83
        compare_tree = mock_syntax_tree("(term (term (factor 20) (:Token /) (factor 4)) (:Token *) (factor 3))")
84
        assert tree == compare_tree, tree.as_sxpr()
85

86
87
88
89
90
91
92
    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

93
94
95
96
97
98
99
    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
100
        tree = parser(ebnf)
101
102
103
104
105
106
107
108
109
110
111
112
113
114
        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

115
116
117
    def test_len_and_pos(self):
        """Test len-property of Node."""
        nd1 = Node(None, "123")
118
        assert len(nd1) == 3, "Expected Node.len == 3, got %i" % len(nd1)
119
        nd2 = Node(None, "456")
120
        assert len(nd2) == 3, "Expected Node.len == 3, got %i" % len(nd2)
121
        nd = Node(None, (nd1, nd2))
122
        assert len(nd) == 6, "Expected Node.len == 6, got %i" % len(nd)
123
124
125
126
127
        nd.pos = 0
        assert nd.pos == 0, "Expected Node.pos == 0, got %i" % nd.pos
        assert nd1.pos == 0, "Expected Node.pos == 0, got %i" % nd1.pos
        assert nd2.pos == 3, "Expected Node.pos == 3, got %i" % nd2.pos

128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
    def test_collect_errors(self):
        tree = mock_syntax_tree('(A (B 1) (C (D (E 2) (F 3))))')
        A = tree
        B = next(tree.find(lambda node: str(node) == "1"))
        D = next(tree.find(lambda node: node.parser.name == "D"))
        F = next(tree.find(lambda node: str(node) == "3"))
        B.add_error("Error in child node")
        F.add_error("Error in child's child node")
        tree.error_flag = Error.ERROR
        errors = tree.collect_errors()
        assert len(errors) == 2, str(errors)
        assert A.error_flag
        assert D.error_flag
        errors = tree.collect_errors(clear_errors=True)
        assert len(errors) == 2
        assert not D.error_flag

145

146
class TestErrorHandling:
147
    def test_error_flag_propagation(self):
148
        tree = mock_syntax_tree('(a (b c) (d (e (f (g h)))))')
149

150
151
        def find_h(context):
            node = context[-1]
152
153
154
155
156
157
158
159
            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


160
if __name__ == "__main__":
161
    from DHParser.testing import runner
162
    runner("", globals())