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
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
|
/* ____ ____ ____ ____ ______ *\
** / __// __ \/ __// __ \/ ____/ SOcos COmpiles Scala **
** __\_ \/ /_/ / /__/ /_/ /\_ \ (c) 2002-2004, LAMP/EPFL **
** /_____/\____/\___/\____/____/ **
\* */
// $Id$
import scalac.ast._;
import scalac.atree.AConstant;
import scalac._;
import scalac.symtab.Modifiers;
import scala.tools.util.Position;
import java.lang.{Integer, Long, Float, Double};
import scala.Iterator;
import scala.tools.scalac.util.NewArray;
import scala.collection.immutable.ListMap ;
import scala.collection.mutable.Buffer;
import scala.xml.{Text,TextBuffer};
import scalac.util.Name;
package scala.tools.scalac.ast.parser {
class MarkupParser( unit:Unit, s:Scanner, p:Parser, preserveWS:boolean ) {
import Tokens.{EMPTY, LBRACE, RBRACE} ;
import scala.tools.scalac.ast.{TreeList => myTreeList}
/** the XML tree factory */
val mk = new SymbolicXMLBuilder( unit.global.make, unit.global.treeGen, p, preserveWS );
/** the XML tree builder */
val gen = unit.global.treeGen ;
var mode:boolean = false;
final val PATTERN = true;
final val EXPR = false;
/** xLiteral = xExpr { xExpr }
* @return Scala representation of this xml literal
* precondition: s.xStartsXML == true
*/
def xLiteral:Tree = {
mode = EXPR;
val pos = s.pos;
var tree = xExpr; s.token = EMPTY; s.nextToken();
if( s.xStartsXML ) {
val ts = new myTreeList(); ts.append( tree );
while( s.xStartsXML ) { ts.append( xExpr ); s.nextToken(); }
tree = mk.makeXMLseq( pos, ts.toArray() );
}
tree
}
/** parse attribute and add it to listmap
* [41] Attributes ::= { S Name Eq AttValue }
* AttValue ::= `'` { _ } `'`
* | `"` { _ } `"`
* | `{` scalablock `}`
*/
def xAttributes = {
var aMap = new ListMap[String, Tree];
while( xml.Parsing.isNameStart( s.ch )) {
val key = s.xName.toString();
s.xEQ;
val delim = s.ch;
val value:Tree = s.ch match {
case '"' | '\'' =>
val pos = s.pos;
s.xNext;
val tmp = s.xAttributeValue( delim );
s.xNext;
gen.mkStringLit( pos, tmp )
case '{' =>
s.xNext;
xScalaExpr;
case _ =>
s.xSyntaxError( "' or \" delimited attribute value or '{' scala-expr '}' expected" );
gen.mkStringLit( s.pos, "<syntax-error>" )
};
// well-formedness constraint: unique attribute names
if( aMap.contains( key ))
s.xSyntaxError( "attribute "+key+" may only be defined once" );
aMap = aMap.update( key, value );
if(( s.ch != '/' )&&( s.ch != '>' ))
s.xSpace;
};
aMap
}
/** parse a start or empty tag.
* [40] STag ::= '<' Name { S Attribute } [S]
* [44] EmptyElemTag ::= '<' Name { S Attribute } [S]
*/
def xTag = {
val elemName = s.xName;
s.xSpaceOpt;
val aMap = if(xml.Parsing.isNameStart( s.ch )) {
xAttributes;
} else {
ListMap.Empty[String,Tree];
}
Tuple2( elemName, aMap );
}
/* [42] '<' xmlEndTag ::= '<' '/' Name S? '>' */
def xEndTag( n:Name ) = {
s.xToken('/');
val m = s.xName;
if(n != m) s.xSyntaxError( "expected closing tag of " + n/* +", not "+m*/);
s.xSpaceOpt;
s.xToken('>')
}
def xScalaExpr:Tree = {
s.xSync;
val b = p.expr(true,false);
if(s.token != RBRACE)
s.xSyntaxError(" expected end of Scala block");
return b
}
/** '<' xExpr ::= xmlTag1 '>' { xmlExpr | '{' simpleExpr '}' } ETag
* | xmlTag1 '/' '>'
* the caller has to resynchronize with s.token = EMPTY; s.nextToken;
*/
def xExpr:Tree = {
var pos = s.pos;
val Tuple2(qname:Name, attrMap:ListMap[String,Tree]) = xTag;
if(s.ch == '/') { // empty element
s.xToken('/');
s.xToken('>');
mk.makeXML( pos, qname, attrMap, Tree.EMPTY_ARRAY );
} else { // handle content
s.xToken('>');
val ts = new myTreeList();
var exit = false;
while( !exit ) {
if( s.xScalaBlock ) {
ts.append( xScalaExpr );
} else {
pos = s.pos;
s.ch match {
case '<' => // another tag
s.xNext;
s.ch match {
case '/' => exit = true; // end tag
case '!' =>
s.xNext;
if( '[' == s.ch ) // CDATA
ts.append( mk.CharData( pos, s.xCharData ));
else // comment
ts.append( mk.Comment( pos, s.xComment ));
case '?' => // PI
s.xNext;
ts.append( mk.ProcInstr( pos, s.xProcInstr ));
case _ => ts.append( xExpr ); // child
}
case '{' =>
if( s.xCheckScalaBlock ) {
ts.append( xScalaExpr );
} else {
val str = new StringBuffer("{");
str.append( s.xText );
mk.appendTrimmed( pos, mode, ts, str.toString() )
}
// postcond: s.xScalaBlock == false!
case '&' => // EntityRef or CharRef
s.xNext;
s.ch match {
case '#' => // CharacterRef
s.xNext;
val theChar = mk.makeText( s.pos, false, s.xCharRef );
s.xToken(';');
ts.append( theChar );
case _ => // EntityRef
val n = s.xName ;
s.xToken(';');
ts.append( mk.EntityRef( pos, n ));
}
case _ => // text content
mk.appendTrimmed( pos, mode, ts, s.xText );
// here s.xScalaBlock might be true
}
}
}
xEndTag( qname );
mk.makeXML( pos, qname, attrMap, ts.toArray() );
}
}
/** @see xmlPattern. resynchronizes after succesful parse
def xLiteralPattern = {
val t = xPattern; s.nextToken(); t
}
*/
/** @see xmlPattern. resynchronizes after succesful parse
* @return this xml pattern
* precondition: s.xStartsXML == true
*/
def xLiteralPattern:Tree = {
val oldMode = mode;
mode = PATTERN;
val pos = s.pos;
var tree = xPattern; s.token = EMPTY; s.nextToken();
if( s.xStartsXML ) {
val ts = new myTreeList(); ts.append( tree );
while( s.xStartsXML ) { ts.append( xPattern ); s.nextToken(); }
tree = mk.makeXMLseqPat( pos, ts.toArray() );
}
mode = oldMode;
tree
}
/** xScalaPatterns ::= patterns
*/
def xScalaPatterns:Array[Tree] = {
s.xSync;
val b = p.patterns();
if( s.token != RBRACE )
s.xSyntaxError(" expected end of Scala patterns");
return b
}
/** '<' xPattern ::= Name [S] { xmlPattern | '{' pattern3 '}' } ETag
* | Name [S] '/' '>'
*/
def xPattern:Tree = {
//Console.println("xPattern");
val pos = s.pos;
val qname = s.xName;
s.xSpaceOpt;
if( s.ch == '/' ) { // empty tag
s.xNext;
s.xToken('>');
return mk.makeXMLpat( pos, qname, Tree.EMPTY_ARRAY );
};
// else: tag with content
s.xToken('>');
val ts = new myTreeList();
var exit = false;
while( !exit ) {
if( s.xScalaBlock ) {
ts.append( xScalaPatterns );
} else
s.ch match {
case '<' => { // tag
s.xNext;
if( s.ch != '/' ) { //child
ts.append( xPattern );
} else {
exit = true
}
}
case '{' => // embedded Scala patterns
while( s.ch == '{' ) {
s.nextch();
ts.append( xScalaPatterns );
}
// postcond: s.xScalaBlock = false;
if( s.xScalaBlock ) throw new ApplicationError(); // assert
case _ => // text
mk.appendTrimmed( pos, mode, ts, s.xText );
// here s.xScalaBlock might be true;
//if( s.xScalaBlock ) throw new ApplicationError("after:"+text); // assert
}
}
xEndTag( qname );
mk.makeXMLpat( pos, qname, ts.toArray() );
}
} /* class MarkupParser */
}
|
