PyCom/make_tree.py at master · mimic-asy/PyCom · GitHub

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
TK_NUM = 995
TK_EQ = 996
TK_NE = 997
TK_LT = 998
TK_LE = 999

ND_ADD = '+'
ND_SUB = '-'
ND_MUL = '*'
ND_DIV = '/'
ND_EQ = '=='
ND_NE = '!='
ND_LT = '<'
ND_LE = '<='

class Node:
    def __init__(self,kind,lhs,rhs,val):
        self.kind = kind
        self.lhs = lhs
        self.rhs = rhs
        self.val = val

#記号チェック用
def consume(lism,op):
    if  lism != op:
        return False

    return True


#エラーを出す用
def expect(lism,op):

    if lism != op:
        raise ValueError(f'"{op}"ではありません')

#数字を返す用
def expect_number(lis,m):

    if lis[m].isdigit():
        number_node = int(lis[m])

        return number_node


    raise ValueError(f'"数字ではありません"')

def new_node(nodekind,val):
    node = Node(nodekind,0,0,val)
    return node


def new_binary(nodekind, lhs, rhs):
    node = Node(nodekind, lhs, rhs, 0)
    return node


def expr(lis,m):

    node,m = equality(lis,m)
    return node , m


def equality(lis,m):
    node,m = relational(lis,m)

    while m < len(lis):
        if consume(lis[m],'=='):
            m+=1
            rhs,m = relational(lis,m)
            node = new_binary(ND_EQ, node, rhs)
        elif consume(lis[m],'!='):
            m+=1
            rhs,m = relational(lis,m)
            node= new_binary(ND_NE, node, rhs)
        else:
            break

    return node, m


def relational(lis,m):
    node,m = add(lis,m)

    while m < len(lis):
        if consume(lis[m], '<'):

            m+=1
            rhs,m = add(lis,m)
            node = new_binary(ND_LT,node,rhs)

        elif consume(lis[m], '<='):

            m+=1
            rhs,m = add(lis,m)
            node = new_binary(ND_LE,node,rhs)
        elif consume(lis[m], '>'):

            m+=1
            rhs,m = add(lis,m)
            node = new_binary(ND_LT,rhs,node)

        elif consume(lis[m], '>='):

            m+=1
            rhs,m = add(lis,m)
            node = new_binary(ND_LT,rhs,node)

        else:
            break
    return node ,m

def add(lis,m):
    node,m = mul(lis,m)

    while m < len(lis):
        if consume(lis[m],'+'):
            m += 1
            rhs,m = add(lis,m)
            node = new_binary(ND_ADD, node, rhs)
        elif consume(lis[m],'-'):
            m +=1
            rhs,m = add(lis,m)
            node = new_binary(ND_SUB,node,rhs)
        else:
            break

    return node,m

def mul(lis,m):
    node,m = unary(lis,m)

    while m < len(lis):
        if consume(lis[m],'*'):
            m +=1
            rhs,m = unary(lis,m)
            node = new_binary(ND_MUL,node,rhs)
        elif consume(lis[m],'/'):
            m+=1
            rhs,m = unary(lis,m)
            node = new_binary(ND_DIV,node,rhs)
        else:
            break

    return node, m


def unary(lis,m):
    if consume(lis[m],'+'):
        m += 1
        node,m = unary(lis,m)
        return node ,m
    elif consume(lis[m],'-'):
        m += 1
        rhs,m =unary(lis,m)
        return new_binary(ND_SUB,0,rhs)
    else:
        node, m = primary(lis,m)
        return node,m


def primary(lis,m):
    if consume(lis[m],'('):
        m+=1
        node,m= expr(lis,m)
        expect(lis[m],')')
        m+=1
        return node,m
    else:
        inta = expect_number(lis,m)
        node = new_node(TK_NUM,inta)
        m+=1
        return node,m