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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
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
252
253
254
255
256
257
258
259
|
#!/bin/env python
# -*- coding: utf-8 -*-
# Copyright (C) 2022 Iván Alejandro Ávalos Díaz <avalos@disroot.org>
# Edgar Alexis López Martínez <edgarmlmp@gmail.com>
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <https://www.gnu.org/licenses/>.
import uuid
import graphviz as gv
from dataclasses import dataclass
from enum import Enum, auto
from typing import List, Optional
from astree.graphable import Graphable
from astree.type import Type
from astree.ident import Ident
Expr = None
# An identifier access expression.
#
# a
@dataclass
class AccessIdentifier(Graphable):
ident: Ident
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, self.ident)
dot.edge(parent, name, label = edge)
# An access expression.
AccessExpr = AccessIdentifier
# An assignment expression.
#
# a = 10
@dataclass
class AssignExpr(Graphable):
_object: AccessExpr
value: Expr
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'AssignExpr')
dot.edge(parent, name, label = edge)
self._object.graph(dot, name, 'object')
if isinstance(self.value, Graphable):
self.value.graph(dot, name, 'value')
# A binary arithmetic operator.
class BinarithmOp(Enum):
BAND = '&'
BOR = '|'
DIV = '/'
GT = '>'
GTEQ = '>='
LAND = '&&'
LEQUAL = '=='
LESS = '<'
LESSEQ = '<='
LOR = '||'
MINUS = '-'
NEQUAL = '!='
PLUS = '+'
TIMES = '*'
# A binary arithmetic expression.
#
# a * b
@dataclass
class BinarithmExpr(Graphable):
op: BinarithmOp
lvalue: Expr
rvalue: Expr
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'BinarithmExpr')
dot.edge(parent, name, label = edge)
name_op = uuid.uuid1().hex
dot.node(name_op, self.op.value)
dot.edge(name, name_op, 'op')
if isinstance(self.lvalue, Graphable):
self.lvalue.graph(dot, name, 'lvalue')
if isinstance(self.rvalue, Graphable):
self.rvalue.graph(dot, name, 'rvalue')
# A break expression.
#
# detener
@dataclass
class BreakExpr(Graphable):
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'BreakExpr')
dot.edge(parent, name, label = edge)
# A function call expression.
#
# foo(bar)
@dataclass
class CallExpr(Graphable):
lvalue: Expr
args: List[Expr]
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'CallExpr')
dot.edge(parent, name, label = edge)
if isinstance(self.lvalue, Graphable):
self.lvalue.graph(dot, name, 'lvalue')
for a in self.args:
if isinstance(a, Graphable):
a.graph(dot, name, 'arg')
# A compound expression.
#
# {
# foo;
# bar;
# // ...
# }
@dataclass
class CompoundExpr(Graphable):
exprs: List[Expr]
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'CompoundExpr')
dot.edge(parent, name, label = edge)
for e in self.exprs:
if isinstance(e, Graphable):
e.graph(dot, name, 'expr')
# A continue expression.
#
# continuar
@dataclass
class ContinueExpr(Graphable):
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'ContinueExpr')
dot.edge(parent, name, label = edge)
# A scalar value.
@dataclass
class Value(Graphable):
value: bool | str | int
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, str(self.value))
dot.edge(parent, name, label = edge)
# An integer constant.
@dataclass
class NumberConstant(Graphable):
value: int
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, str(self.value))
dot.edge(parent, name, label = edge)
# A constant expression.
ConstantExpr = Value | NumberConstant
# An if or if..else expression.
#
# si (a) { } sino { }
@dataclass
class IfExpr(Graphable):
cond: Expr
tbranch: Expr
fbranch: Optional[Expr]
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'IfExpr')
dot.edge(parent, name, label = edge)
if isinstance(self.cond, Graphable):
self.cond.graph(dot, name, 'cond')
if isinstance(self.tbranch, Graphable):
self.tbranch.graph(dot, name, 'tbranch')
if self.fbranch and isinstance(self.fbranch, Graphable):
self.fbranch.graph(dot, name, 'fbranch')
# A print statement.
#
# imprimir a
@dataclass
class PrintExpr(Graphable):
expr: Expr
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'PrintExpr')
dot.edge(parent, name, label = edge)
if isinstance(self.expr, Graphable):
self.expr.graph(dot, name, 'expr')
# A read statement.
#
# leer a
@dataclass
class ReadExpr(Graphable):
expr: AccessExpr
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'ReadExpr')
dot.edge(parent, name, label = edge)
self.expr.graph(dot, name, 'expr')
# A return statement.
#
# retorna a
@dataclass
class ReturnExpr(Graphable):
expr: Optional[Expr]
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'ReturnExpr')
dot.edge(parent, name, label = edge)
if self.expr and isinstance(self.expr, Graphable):
self.expr.graph(dot, name, 'expr')
# A while expression.
#
# mientras (cond) { }
@dataclass
class WhileExpr(Graphable):
cond: Expr
body: Expr
def graph(self, dot: gv.Digraph, parent: str = None, edge: str = None) -> None:
name = uuid.uuid1().hex
dot.node(name, 'WhileExpr')
dot.edge(parent, name, label = edge)
if isinstance(self.cond, Graphable):
self.cond.graph(dot, name, 'cond')
if isinstance(self.body, Graphable):
self.body.graph(dot, name, 'body')
# A Javañol expression.
Expr = (AccessExpr | AssignExpr | BinarithmExpr | BreakExpr |
CallExpr | ConstantExpr | ContinueExpr | IfExpr |
CompoundExpr | PrintExpr | ReadExpr | ReturnExpr)
|
