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
|
#region license
// Copyright (c) 2004-2005, Daniel Grunwald (daniel@danielgrunwald.de)
// Copyright (c) 2005, Peter Johanson (latexer@gentoo.org)
// All rights reserved.
//
// The BooBinding.Parser code is originally that of Daniel Grunwald
// (daniel@danielgrunwald.de) from the SharpDevelop BooBinding. The code has
// been imported here, and modified, including, but not limited to, changes
// to function with MonoDevelop, additions, refactorings, etc.
//
// BooBinding 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 2 of the License, or
// (at your option) any later version.
//
// BooBinding 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 BooBinding; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#endregion
/*
namespace BooBinding.Parser
import System
import System.Text
import MonoDevelop.Projects.Dom
import MonoDevelop.Projects.Dom.Parser
class ExpressionFinder(IExpressionFinder):
// The expression finder can find an expression in a text
// inText is the full source code, offset the cursor position
// example: "_var = 'bla'\n_var^\nprint _var"
// where ^ is the cursor position
// in that simple case the expression finder should return 'n_var'.
// but also complex expressions like
// 'filename.Substring(filename.IndexOf("var="))'
// should be returned if the cursor is after the last ).
// implementation note: the text after offset is irrelevant, so
// every operation on the string aborts after reaching offset
static _closingBrackets = '}])'
static _openingBrackets = '{[('
def FindExpression(inText as string, offset as int) as ExpressionResult:
return ExpressionResult (null) if inText == null
Log ("Trying quickfind for ${offset}")
// OK, first try a kind of "quick find"
i = offset + 1
forbidden = '"\'/#)]}'
finish = '([{=+*<,:'
start = -1
while i > 0:
i -= 1
c = inText[i]
if finish.IndexOf(c) >= 0:
start = i + 1
break
if forbidden.IndexOf(c) >= 0:
Log ("Quickfind failed: got ${c}")
break
if Char.IsWhiteSpace(c):
if i > 6 and inText.Substring(i - 6, 6) == "import":
i -= 7 // include 'import' in the expression
start = i + 1
break
if start >= 0:
if CheckString(inText, start, '/#"\'', '\r\n'):
return ExpressionResult (GetExpression(inText, start, offset + 1))
inText = SimplifyCode(inText, offset)
if inText == null:
Log ('SimplifyCode returned null (cursor is in comment/string???)')
return ExpressionResult (null)
// inText now has no comments or string literals, but the same meaning in
// terms of the type system
// Now go back until a finish-character or a whitespace character
bracketStack = StringBuilder() // use Stack<char> instead in .NET 2.0
i = inText.Length
while i > 0:
i -= 1
c = inText[i]
if bracketStack.Length == 0 and (finish.IndexOf(c) >= 0 or Char.IsWhiteSpace(c)):
return ExpressionResult (GetExpression(inText, i + 1, inText.Length))
if _closingBrackets.IndexOf(c) >= 0:
bracketStack.Append(c)
bracket = _openingBrackets.IndexOf(c)
if bracket >= 0:
while Pop(bracketStack) > bracket:
pass
return ExpressionResult (null)
def FindFullExpression(inText as string, offset as int) as ExpressionResult:
return ExpressionResult (null)
def RemoveLastPart(expression as string) as string:
return expression
private def CheckString(text as string, offset as int, forbidden as string, finish as string):
i = offset
while i > 0:
i -= 1
c = text[i]
return false if forbidden.IndexOf(c) >= 0
return true if finish.IndexOf(c) >= 0
return true
private def Pop(bracketStack as StringBuilder):
return -1 if bracketStack.Length == 0
c = bracketStack[bracketStack.Length - 1]
bracketStack.Length -= 1
return _closingBrackets.IndexOf(c)
private def GetExpression(inText as string, start as int, end as int):
b = StringBuilder()
wasSpace = true
i = start
while i < end:
c = inText[i]
if Char.IsWhiteSpace(c):
b.Append(' ') unless wasSpace
wasSpace = true
else:
wasSpace = false
b.Append(c)
i += 1
Log ("Expression is '${b}'")
return b.ToString().Trim()
// this method makes boo source code "simpler" by removing all comments
// and replacing all types of strings through string.Empty.
// TODO: We could need some unit tests for this.
static _elseIndex = 10
*/
// static _stateTable = ( // " ' \ \n $ { } # / * else
// /* 0: in Code */ ( 1 , 7 , 0 , 0 , 0 , 0 , 0 , 13 , 12 , 0 , 0 ),
// /* 1: after " */ ( 2 , 6 , 10 , 0 , 8 , 6 , 6 , 6 , 6 , 6 , 6 ),
// /* 2: after "" */ ( 3 , 7 , 0 , 0 , 0 , 0 , 0 , 13 , 12 , 0 , 0 ),
// /* 3: in """ */ ( 4 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 ),
// /* 4: in """, " */ ( 5 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 ),
// /* 5: in """, "" */ ( 0 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 , 3 ),
// /* 6: in "-string */ ( 0 , 6 , 10 , 0 , 8 , 6 , 6 , 6 , 6 , 6 , 6 ),
// /* 7: in '-string */ ( 7 , 0 , 11 , 0 , 7 , 7 , 7 , 7 , 7 , 7 , 7 ),
// /* 8: after $ in " */ ( 0 , 6 , 10 , 0 , 8 , 9 , 6 , 6 , 6 , 6 , 6 ),
// /* 9: in "{ */ ( 9 , 9 , 9 , 9 , 9 , 9 , 6 , 9 , 9 , 9 , 9 ),
// /* 10: after \ in " */ ( 6 , 6 , 6 , 0 , 6 , 6 , 6 , 6 , 6 , 6 , 6 ),
// /* 11: after \ in ' */ ( 7 , 7 , 7 , 0 , 7 , 7 , 7 , 7 , 7 , 7 , 7 ),
// /* 12: after / */ ( 1 , 7 , 0 , 0 , 0 , 0 , 0 , 0 , 13 ,-14 , 0 ),
// /* 13: line comment */ ( 13 , 13 , 13 , 0 , 13 , 13 , 13 , 13 , 13 , 13 , 13 ),
// /* 14: block comment*/ ( 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 , 15 , 14 ),
// /* 15: after * in bc*/ ( 14 , 14 , 14 , 14 , 14 , 14 , 14 , 14 ,-15 , 15 , 14 )
// )
/*
def SimplifyCode(inText as string, offset as int):
result = StringBuilder()
inStringResult = StringBuilder(' ')
state = 0
commentblocks = 0
inputTable = array(int, 128)
for i in range(128):
inputTable[i] = _elseIndex
inputTable[ 34] = 0 // "
inputTable[ 39] = 1 // '
inputTable[ 92] = 2 // \
inputTable[ 10] = 3 // \n
inputTable[ 13] = 3 // \r
inputTable[ 36] = 4 // $
inputTable[123] = 5 // {
inputTable[125] = 6 // }
inputTable[ 35] = 7 // #
inputTable[ 47] = 8 // /
inputTable[ 42] = 9 // *
for i in range(offset + 1):
c as Char = inText[i]
// TODO: Direct char->int conversion
charNum as int = Encoding.ASCII.GetBytes((c,))[0]
if charNum > 127:
input = _elseIndex
else:
input = inputTable[charNum]
action = _stateTable[state][input]
if action == -14:
// enter block comment
commentblocks += 1
state = 14
elif action == -15:
// leave block comment
commentblocks -= 1
if commentblocks == 0:
state = 0
else:
state = 14
elif action == 9:
if state == 9:
inStringResult.Append(c)
else:
inStringResult.Length = 1
state = action
elif action == 0 or action == 12:
if state == 2 or (state >= 6 and state <= 11):
result.Append("string.Empty")
if state == 0 or state == 2 or state == 12:
result.Append(c)
state = action
else:
state = action
if state == 0 or state == 2 or state == 12:
return result.ToString()
elif state == 9:
return inStringResult.ToString()
else:
return null
private def Log (message):
BooParser.Log (self.GetType(), message)
*/
|
