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
|
/* NSC -- new Scala compiler
* Copyright 2005-2007 LAMP/EPFL
* @author Martin Odersky
*/
// $Id: $
package scala.tools.nsc.ast
import compat.Platform.EOL
import symtab.Flags._
/** The object <code>nodePrinter</code> converts the internal tree
* representation to a string formatted as a Scala expression.
*
* @author Stephane Micheloud
* @version 1.0
*/
abstract class NodePrinters {
val global: Global
import global._
object InfoLevel extends Enumeration {
val Quiet, Normal, Verbose = Value
}
var infolevel = InfoLevel.Quiet
object nodeToString extends Function1[Tree, String] {
private val buf = new StringBuilder
def apply(tree: Tree): String = {
def traverse(tree: Tree, level: Int, comma: Boolean) {
def println(s: String) {
for (i <- 0 until level) buf.append(" ")
buf.append(s)
buf.append(EOL)
}
def printcln(s: String) {
for (i <- 0 until level) buf.append(" ")
buf.append(s)
if (comma) buf.append(",")
buf.append(EOL)
}
def annotationInfoToString(attr: AnnotationInfo[Constant]) = {
val str = new StringBuilder
str.append(attr.atp.toString())
if (!attr.args.isEmpty)
str.append(attr.args.mkString("(", ",", ")"))
if (!attr.assocs.isEmpty)
for (((name, value), index) <- attr.assocs.zipWithIndex) {
if (index > 0)
str.append(", ")
str.append(name).append(" = ").append(value)
}
str.toString
}
def symflags(tree: Tree): String = {
val sym = tree.symbol
val buf = new StringBuffer
if (sym hasFlag BRIDGE ) buf.append(" | BRIDGE")
if (sym hasFlag FINAL ) buf.append(" | FINAL")
if (sym hasFlag LOCAL ) buf.append(" | LOCAL")
if (sym hasFlag METHOD ) buf.append(" | METHOD")
if (sym hasFlag PARAMACCESSOR) buf.append(" | PARAMACCESSOR")
if (sym hasFlag PRIVATE ) buf.append(" | PRIVATE")
if (sym hasFlag STATIC ) buf.append(" | STATIC")
if (sym hasFlag SYNTHETIC ) buf.append(" | SYNTHETIC")
val attrs = ", attrs=" + (
if (!sym.attributes.isEmpty)
sym.attributes.map(annotationInfoToString).mkString("[", ",", "]")
else
tree.asInstanceOf[MemberDef].mods.annotations)
(if (buf.length() > 2) buf.substring(3)
else "0") + ", // flags=" + flagsToString(sym.flags) + attrs
}
def nodeinfo(tree: Tree) =
if (infolevel == InfoLevel.Quiet) ""
else {
val buf = new StringBuilder(" // sym=" + tree.symbol)
if (infolevel > InfoLevel.Quiet && tree.symbol != null)
buf.append(", sym.tpe=" + tree.symbol.tpe)
if (tree.hasSymbol)
if (tree.symbol.isPrimaryConstructor)
buf.append(", isPrimaryConstructor")
else if (tree.symbol.isConstructor)
buf.append(", isConstructor")
buf.append(", tpe=" + tree.tpe)
if (tree.tpe != null) {
val sym = tree.tpe.symbol
buf.append(", tpe.sym=" + sym)
if (sym != NoSymbol) {
buf.append(", tpe.sym.owner=" + sym.owner)
if ((infolevel > InfoLevel.Normal) &&
!(sym.owner eq definitions.ScalaPackageClass) &&
!sym.isModuleClass && !sym.isPackageClass &&
!sym.hasFlag(JAVA)) {
val members = for (m <- tree.tpe.decls.toList)
yield m.toString() + ": " + m.tpe + ", "
buf.append(", tpe.decls=" + members)
}
}
}
buf.toString
}
def nodeinfo2(tree: Tree) =
(if (comma) "," else "") + nodeinfo(tree)
tree match {
case AppliedTypeTree(tpt, args) =>
println("AppliedTypeTree(" + nodeinfo(tree))
traverse(tpt, level + 1, true)
if (args.isEmpty)
println(" List() // no argument")
else {
val n = args.length
println(" List( // " + n + " arguments(s)")
for (i <- 0 until n)
traverse(args(i), level + 2, i < n-1)
println(" )")
}
printcln(")")
case Apply(fun, args) =>
println("Apply(" + nodeinfo(tree))
traverse(fun, level + 1, true)
if (args.isEmpty)
println(" List() // no argument")
else {
val n = args.length
println(" List( // " + n + " argument(s)")
for (i <- 0 until n)
traverse(args(i), level + 2, i < n-1)
println(" )")
}
printcln(")")
case Block(stats, expr) =>
println("Block(")
if (stats.isEmpty)
println(" List() // no statement")
else {
val n = stats.length
println(" List( // " + n + " statement(s)")
for (i <- 0 until n)
traverse(stats(i), level + 2, i < n-1)
println(" )")
}
traverse(expr, level + 1, false)
printcln(")")
case ClassDef(mods, name, tparams, tpt, impl) =>
println("ClassDef(" + nodeinfo(tree))
println(" " + symflags(tree))
println(" \"" + name + "\",")
if (tparams.isEmpty)
println(" List(), // no type parameter")
else {
val n = tparams.length
println(" List( // " + n + " type parameter(s)")
for (i <- 0 until n)
traverse(tparams(i), level + 2, i < n-1)
println(" ),")
}
traverse(impl, level + 1, false)
printcln(")")
case DefDef(mods, name, tparams, vparamss, tpt, rhs) =>
println("DefDef(" + nodeinfo(tree))
println(" " + symflags(tree))
println(" \"" + name + "\",")
if (tparams.isEmpty)
println(" List(), // no type parameter")
else {
val n = tparams.length
println(" List( // " + n + " type parameter(s)")
for (i <- 0 until n)
traverse(tparams(i), level + 2, i < n-1)
println(" ),")
}
traverse(rhs, level + 1, false)
printcln(")")
case EmptyTree =>
printcln("EmptyTree")
case Ident(name) =>
printcln("Ident(\"" + name + "\")" + nodeinfo2(tree))
case Literal(value) =>
printcln("Literal(" + value + ")")
case New(tpt) =>
println("New(" + nodeinfo(tree))
traverse(tpt, level + 1, false)
printcln(")")
case Select(qualifier, selector) =>
println("Select(" + nodeinfo(tree))
traverse(qualifier, level + 1, true)
printcln(" \"" + selector + "\")")
case Super(qual, mix) =>
printcln("Super(\"" + qual + "\", \"" + mix + "\")" + nodeinfo2(tree))
case Template(parents, body) =>
println("Template(," + nodeinfo(tree))
println(" " + parents.map(p => p.tpe.symbol) + ", // parents")
if (body.isEmpty)
println(" List() // no body")
else {
val n = body.length
println(" List( // body")
for (i <- 0 until n)
traverse(body(i), level + 2, i < n-1)
println(" )")
}
printcln(")")
case This(qual) =>
println("This(\"" + qual + "\")" + nodeinfo2(tree))
case TypeApply(fun, args) =>
println("TypeApply(" + nodeinfo(tree))
traverse(fun, level + 1, true)
if (args.isEmpty)
println(" List() // no argument")
else {
val n = args.length
println(" List(")
for (i <- 0 until n)
traverse(args(i), level + 1, i < n-1)
println(" )")
}
printcln(")")
case TypeTree() =>
printcln("TypeTree()" + nodeinfo2(tree))
case Typed(expr, tpt) =>
println("Typed(" + nodeinfo(tree))
traverse(expr, level + 1, true)
traverse(tpt, level + 1, false)
printcln(")")
case ValDef(mods, name, tpt, rhs) =>
println("ValDef(" + nodeinfo(tree))
println(" " + symflags(tree))
println(" \"" + name + "\",")
traverse(tpt, level + 1, true)
traverse(rhs, level + 1, false)
printcln(")")
case _ =>
printcln("***" + tree.getClass)
}
}
buf setLength 0
traverse(tree, 0, false)
buf.toString
}
}
}
|
