-
-
Notifications
You must be signed in to change notification settings - Fork 83
/
scope_data.py
212 lines (177 loc) · 4.06 KB
/
scope_data.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
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
# https://manual.macromates.com/en/language_grammars#naming_conventions
import sys
if sys.version_info[0] > 2:
basestring = str
__all__ = ["COMPILED_NODES", "COMPILED_HEADS"]
DATA = """
comment
line
double-slash
double-dash
number-sign
percentage
block
documentation
constant
numeric
character
escape
language
other
entity
name
function
type
tag
section
other
inherited-class
attribute-name
invalid
illegal
deprecated
keyword
control
operator
other
markup
underline
link
bold
heading
italic
list
numbered
unnumbered
quote
raw
other
meta
punctuation
definition
string
begin
end
sequence
begin
end
mapping
begin
end
separator
sequence
mapping
key-value
pair
storage
type
modifier
string
quoted
single
double
triple
other
unquoted
interpolated
regexp
other
support
function
class
type
constant
variable
other
variable
parameter
language
other
"""
class NodeList(list):
"""
Methods:
* find(name)
* find_all(name)
* to_completion()
"""
def find(self, name):
for node in self:
if node == name:
return node
return None
def find_all(self, name):
res = NodeList()
for node in self:
if node == name:
res.append(node)
return res
def to_completion(self):
# return zip(self, self)
return [(n.name, n.name) for n in self]
class ScopeNode(object):
"""
Attributes:
* name
* parent
* children
* level | unused
Methods:
* add_child(child)
* tree()
"""
def __init__(self, name, parent=None, children=None):
self.name = name
self.parent = parent
self.children = children or NodeList()
self.level = parent and parent.level + 1 or 1
def add_child(self, child):
self.children.append(child)
def tree(self):
if self.parent:
return self.name + '.' + self.parent.tree()
else:
return self.name
def __eq__(self, other):
if isinstance(other, basestring):
return str(self) == other
def __str__(self):
return self.name
def __repr__(self):
ret = self.name
if self.children:
ret += " {%s}" % ' '.join(map(repr, self.children))
return ret
#######################################
# output values
COMPILED_NODES = NodeList()
COMPILED_HEADS = NodeList()
# parse the DATA string
lines = DATA.split("\n")
# some variables
indent = " " * 4
indent_level = 0
indents = {}
# process lines
# Note: expects sane indentation (such as only indent by 1 `indent` at a time)
for line in lines:
if line.isspace() or not len(line):
# skip blank lines
continue
if line.startswith(indent * (indent_level + 1)):
# indent increased
indent_level += 1
if not line.startswith(indent * indent_level):
# indent decreased
for level in range(indent_level - 1, 0, -1):
if line.startswith(indent * level):
indent_level = level
break
parent = indents[indent_level - 1] if indent_level - 1 in indents else None
node = ScopeNode(line.strip(), parent)
indents[indent_level] = node
if parent:
parent.add_child(node)
else:
COMPILED_HEADS.append(node)
COMPILED_NODES.append(node)