test_syntaxtree.py 5.31 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.syntaxtree import Node, TOKEN_PTYPE, mock_syntax_tree
27 28
from DHParser.transform import traverse, reduce_single_child, \
    replace_by_single_child, flatten, remove_expendables
29
from DHParser.ebnf import get_ebnf_grammar, get_ebnf_transformer, get_ebnf_compiler
30
from DHParser.dsl import grammar_provider
31

32

33 34 35 36 37 38 39 40 41 42 43 44
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


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

    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'

67
    def test_equality1(self):
68 69 70
        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))')
71 72 73 74 75 76
        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],
77 78
                (TOKEN_PTYPE): [remove_expendables, reduce_single_child],
                "?": [remove_expendables, replace_by_single_child]}
79
        parser = grammar_provider(ebnf)()
80 81
        tree = parser("20 / 4 * 3")
        traverse(tree, att)
82
        compare_tree = mock_syntax_tree("(term (term (factor 20) (:Token /) (factor 4)) (:Token *) (factor 3))")
83
        assert tree == compare_tree
84

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

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

114 115 116
    def test_len_and_pos(self):
        """Test len-property of Node."""
        nd1 = Node(None, "123")
117
        assert len(nd1) == 3, "Expected Node.len == 3, got %i" % len(nd1)
118
        nd2 = Node(None, "456")
119
        assert len(nd2) == 3, "Expected Node.len == 3, got %i" % len(nd2)
120
        nd = Node(None, (nd1, nd2))
121
        assert len(nd) == 6, "Expected Node.len == 6, got %i" % len(nd)
122 123 124 125 126
        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

127

128
class TestErrorHandling:
129
    def test_error_flag_propagation(self):
130
        tree = mock_syntax_tree('(a (b c) (d (e (f (g h)))))')
131

132 133
        def find_h(context):
            node = context[-1]
134 135 136 137 138 139 140 141
            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


142
if __name__ == "__main__":
143
    from DHParser.testing import runner
144
    runner("", globals())