-
Notifications
You must be signed in to change notification settings - Fork 0
/
importer.py
134 lines (128 loc) · 3.85 KB
/
importer.py
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
import ast
from lib2to3.pytree import Node
import sys
import argparse
import array
from re import L
from tokenize import String
def compile_op(op):
if isinstance(op, ast.Lt):
return "<"
elif isinstance(op, ast.LtE):
return "<="
elif isinstance(op, ast.Gt):
return ">"
elif isinstance(op, ast.GtE):
return ">="
def resolve_fun(n):
if isinstance(n, ast.Name):
return n.id
elif isinstance(n, ast.Attribute):
if n.value.id == 'math':
return n.attr
else:
raise NotImplementedError("Not Implemented")
def compile_expr(n):
s=""
if isinstance(n, ast.BinOp):
s+="("
if isinstance(n.op, ast.Mult):
s+= "* "
elif isinstance(n.op, ast.Add):
s+= "+ "
elif isinstance(n.op, ast.Div):
s+= "/ "
elif isinstance(n.op, ast.Sub):
s+= "- "
s+= compile_expr(n.left) + " "
s+= compile_expr(n.right) + ")"
if isinstance(n, ast.UnaryOp):
s+="("
if isinstance(n.op, ast.UAdd):
s+= "+ "
elif isinstance(n.op, ast.USub):
s+= "- "
elif isinstance(n.op, ast.Not):
s+= "not "
elif isinstance(n.op, ast.Invert):
raise NotImplemented()
s+= compile_expr(n.operand) + ")"
if isinstance(n, ast.Compare):
left_val = compile_expr(n.left)
args = [compile_expr(arg) for arg in n.comparators]
if len(set(n.ops)) == 1:
s+= "(" + compile_op(n.ops[0]) + " " + " ".join([left_val] + args) + ")"
else:
cs = []
for op,left,right in zip(n.ops, [left_val] + args, args):
c = "(" + compile_op(op) + " " + left + " " + right + ")"
cs.append(c)
s+= "(and " + " ".join(cs) + ")"
if isinstance(n, ast.Constant):
val = str(n.value)
s+= val
if isinstance(n, ast.Call):
s+="("
# s+= resolve_func(n.func)
s+= resolve_fun(n.func)
s+=" "
s+= " ".join([
compile_expr(item)
for item
in n.args
])
s+=")"
elif isinstance(n, ast.Name):
s+=n.id
return s
def parse_main(node):
# node = ast.parse(line)
# print(node)
# print(ast.dump(node, indent=2))
if isinstance(node, ast.FunctionDef) and node.name != 'fmin' and node.name != 'fmax':
# s = "(FPCore " + node.body[0].name + "("
s = "(FPCore " + node.name + "("
s += " ".join([
item.arg
for item
# in node.body[0].args.args
in node.args.args
])
s+=')\n '
end= ""
# for n in node.body[0].body:
for n in node.body:
if isinstance(n, ast.Expr):
s+=compile_expr(n.value)
if isinstance(n, ast.Assign):
s+="(let* (["
s+= ",".join([
item.id
for item
in n.targets
])
s+=" "
s+=compile_expr(n.value)
s+="]) "
end+=")"
if isinstance(n, ast.Return):
s+=compile_expr(n.value)
s+=end
s+=')'
print(s)
elif isinstance(node, ast.Import) and node.names[0].name == 'math':
raise NotImplementedError("import math - is NotImplemented")
else:
raise NotImplementedError("Other code - NotImplemented")
# parser = argparse.ArgumentParser()
# parser.add_argument('file',type=str, help="File to pass") # to handle command line arguments
# args = parser.parse_args()
# print(args.file.readlines())
# print(sys.argv)
input_file = open(sys.argv[1], 'r')
final_str= "" # to store the contents of the file
for l in input_file:
final_str+= l
node= ast.parse(final_str)
for i in node.body:
parse_main(i)