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
|
#! /usr/bin/env python
#
import string, sys, re
class Node:
nodes = {}
children = {}
def __init__ (self, name, parent = None):
self.name = name
if parent: self.parent = parent
elif name == "Root": self.parent = None
else: self.parent = "Root"
self.fields = []
if self.parent:
if Node.children.has_key (self.parent):
Node.children[self.parent].append (self.name)
else:
Node.children[self.parent] = [self.name]
Node.nodes [name] = self
def add_field (self, name, type, init):
self.fields.append ((name, type, init))
def get_words (l):
return string.split (l [0:-1])
def get_fields (n):
if n.parent: return get_fields (Node.nodes [n.parent]) + n.fields
else: return n.fields
def append (kind, name, type):
if fields.has_key (name):
if typess [name] != type:
sys.stderr.write ("Conflicting types for field %s\n" % name)
sys.exit (1)
fields [name].append (kind)
else:
fields [name] = [kind]
typess [name] = type
fields = {}
typess = {}
current = None
started = 0
input = open (sys.argv [1], "r").readlines()
for i in input:
if re.match ("^\s*--", i):
continue
words = get_words (i)
if not words: continue
if not started:
if words == ['START']:
started = 1
continue
continue
if words == ['END']: break
if len (words) >= 3 and words [1] == ':':
if len (words) == 5 and words [3] == ':=':
current.add_field (words [0], words [2], words [4])
else:
current.add_field (words [0], words [2], None)
elif len (words) > 0:
if len (words) == 3 and words [1] == '<--':
current = Node (words [0], words [2])
else:
current = Node (words [0])
else:
sys.stderr.write ("Unknown line: %s\n" % i)
sys.exit (1)
nodes = Node.nodes.keys()
nodes.sort ()
types = []
spec = []
body = []
for n in nodes:
if n == "Root": continue
i = Node.nodes [n]
types.append ("K_%s" % n)
spec.append (" --")
spec.append (" -- %s" % n)
spec.append (" --")
for (name, type, init) in get_fields (i):
append (n, name, type)
spec.append (" -- %-25s : %s" % (name, type))
spec.append (" --")
spec.append ("")
spec.append (" function Make_%s (Loc : Location) return Node_Id;" % n)
spec.append (" function Is_%s (N : Node_Id) return Boolean;" % n)
spec.append ("")
body.append (" function Make_%s (Loc : Location) return Node_Id is" % n)
body.append (" Node : constant Node_Access := new Node_Type;")
body.append (" Index : constant Node_Id := Nodes_Table.Allocate;")
body.append (" begin")
body.append (" Node.Loc := Loc;")
body.append (" Node.Kind := K_%s;" % n)
for (name, type, init) in get_fields (i):
if init:
body.append (" Node.%s := %s;" % (name, init))
body.append (" Nodes_Table.Table (Index) := Node;")
body.append (" return Index;")
body.append (" end Make_%s;" % n)
body.append ("")
body.append (" function Is_%s (N : Node_Id) return Boolean is" % n)
body.append (" begin")
body.append (" return Kind (N) = K_%s" % n)
if Node.children.has_key (n):
for c in Node.children[n]:
body.append (" or else Is_%s (N)" % (c))
body.append (" or else False;")
body.append (" end Is_%s;" % n)
body.append ("")
f = fields.keys ()
f.sort ()
for name in f:
type = typess [name]
kinds = fields [name]
spec.append (" function %s" % (name,));
spec.append (" (N : Node_Id) return %s;" % (type,))
spec.append (" procedure Set_%s" % (name,))
spec.append (" (N : Node_Id; V : %s);" % (type,))
body.append (" function %s" % (name,))
body.append (" (N : Node_Id) return %s" % (type,))
body.append (" is")
body.append (" Node : constant Node_Access := Nodes_Table.Table (N);")
body.append (" begin")
for k in range (len (kinds)):
if k == 0:
if len (kinds) == 1:
assrt = [" pragma Assert (Node.Kind = K_%s);" % kinds [k]]
else:
assrt = [" pragma Assert (Node.Kind = K_%s" %
kinds [k]]
else:
if k == len (kinds) - 1: expr = ");"
else: expr = ""
assrt.append (" or else Node.Kind = K_%s%s" %
(kinds [k], expr))
body = body + assrt
body.append (" return Node.%s;" % name)
body.append (" end %s;" % name)
body.append ("")
body.append (" procedure Set_%s" % (name,))
body.append (" (N : Node_Id; V : %s)" % (type,))
body.append (" is")
body.append (" Node : constant Node_Access := Nodes_Table.Table (N);")
body.append (" begin")
body = body + assrt
body.append (" Node.%s := V;" % name)
body.append (" end Set_%s;" % name)
body.append ("")
if type == "Node_List":
spec.append (" procedure Append_Node_To_%s" % (name))
spec.append (" (N : Node_Id; V : Node_Id);")
body.append (" procedure Append_Node_To_%s" % (name))
body.append (" (N : Node_Id; V : Node_Id)")
body.append (" is")
body.append (" begin")
body.append (" Set_%s" % (name))
body.append (" (N, Append_Node (%s (N), V));" % (name))
body.append (" end Append_Node_To_%s;" % (name))
body.append ("")
spec.append ("")
# with Nodes; use Nodes;
print """with GNAT.Table;
with Idl_Fe.Types; use Idl_Fe.Types;
package Idl_Fe.Tree is
type Node_Kind is"""
for n in range (len (types)):
if n == 0: s = '('
else: s = ' '
if n == len (types) - 1: e = ');'
else: e = ','
print " %s%s%s" % (s, types [n], e)
print
for i in spec:
print i
print "private"
print
print " type Node_Type is record"
for i in f:
if typess [i] == "Node_Id": print " %-25s : %-25s%s;" % (i, typess [i], ":= No_Node")
elif typess [i] == "Node_List": print " %-25s : %-25s%s;" % (i, typess [i], ":= Nil_List")
else: print " %-25s : %s%s;" % (i, typess [i], "")
print " end record;"
print """
type Node_Access is access Node_Type;
package Nodes_Table is
new GNAT.Table (Table_Component_Type => Node_Access,
Table_Index_Type => Node_Id,
Table_Low_Bound => 1,
Table_Initial => 1024,
Table_Increment => 100);
end Idl_Fe.Tree;"""
print "package body Idl_Fe.Tree is"
print
print " use Nodes_Table;"
print
for i in body:
print i
print "end Idl_Fe.Tree;"
|
