4th International Conference on Principles and Practices ... - MADOC

More documents

Recommendations

Info

eturn visit((Expr)p1, param); } R visit(Expr e, P param) throws E { return visit((Node) e, param); } This delegation model allows developers to implement general behavior for some types and specific ones for others. More precisely, they do not have to implement all methods visit() if one of the super-type visitor captures all behaviors of its subtypes. For instance, if the behavior of the visit isthesamefornodesoftypesP1 and P2, the developer only has to implement the method visit(Expr e,...). 3.3.4 Runtime lexer and parser By default, the lexer and the parser are generated offline by the Tatoo generators using XML specifications. However, it is possible to construct them entirely at runtime specifying everything in Java. Indeed, XML specifications are only available for convenience. Internally, rules or productions are reified into Java objects that the developer may construct directly. For instance, the following portion of code creates a rule with id value recognizing numbers using a rule factory. A similar factory is also available for grammar dynamic specification. RuleFactory rf = new RuleFactoryImpl(); Encoding charset = LexerType.unicode.getEncoding(); Map map = Collections.emptyMap(); PatternRuleCompilerImpl ruleCompiler= new PatternRuleCompilerImpl(map,charset); ruleCompiler.createRule(rf,"value","[0-9]+"); Then, given the description of rules, it is possible to directly obtain a lexer without intermediate code generation. However, lexer creation induces several costly computations at runtime, such as automata minimization. The following portion of code constructs a lexer given a rule factory rf, a character buffer b and a lexer listener l. SimpleLexer lexer = RuntimeLexerFactory.createRuntimeLexer(rf,b,l); The lexer constructed this way is then almost as efficient as offline-constructed lexers. 4. RELATED WORKS In this section, the overview of existing compiler generators is restricted to those written in Java and producing Java implementations. Of course, many other tools exist for other languages. 4.1 JavaCC Developed by Sun Microsystems, Java Compiler Compiler [10] is a parser generator written in Java generating top-down parsers. JavaCC by default only works for LL(1) grammars and let the user annotate the grammar with a specific k lookahead to resolve ambiguities. The semantic part of the parser is directly integrated in the grammar specification. The actions are specified in Java and some keywords allow to obtain parsing information. The fact that grammar and semantic part are mixed in the same file is error prone with large grammar and does not permit to reuse the grammar without its semantics. 4.2 ANTLR ANother Tool for Language Recognition [13] written by Terence Parr, is a parser generator generating top-down compilers from grammatical specifications with back-ends in Java, C#, C++, or Python. Like JavaCC, ANTLR is a LL(k) parser generator. The grammar is augmented with actions specifying the semantics of the compiler or translator. ANTLR provides a domain specific language for tree construction, tree walking and tree transformation. 4.3 JFLex/Cup JFlex [7] and Cup [8] are ports of Lex and Yacc in Java. JFlex is a lexer generator in Java that reuses the same regex format than Lex on the unicode charset. Cup generates bottom-up compilers from LALR(1) grammar using a syntax similar to Yacc. Like JavaCC, it mixes the grammar specification and the semantic actions specified in Java. 4.4 SableCC Sable Compiler Compiler [5] was initially written by Etienne Gagnon during its master thesis. It generates a bottomup compiler from a LALR(1) grammar. However, it does not allow to resolve conflicts with associativity and priorities. SableCC does not permit to specify semantics in the grammar but it generates an AST letting the developer rely on visitors to express the semantics. Thus it provides a clean separation between grammar specification and semantics. However, even if the generated AST is tweakable there is no way to generate a specifc tree without creating another AST. 4.5 Beaver Beaver [3] is an LALR(1) parser generator that claims to generate fast compilers. Like Tatoo, beaver generates only a parser table and relies on a runtime parser. Furthermore the table contains actions to perform using late-binding call that frequently outperform the traditional switch implementation. 5. CONCLUSION In this paper we have presented Tatoo a new compiler generator written in Java which main innovative features are: • push lexing and parsing in order to support non blocking IO; • support for grammar evolutions. Tatoo has been used this year for compilation courses. During these courses, students have implemented a compiler for a simple language that produces Java bytecode. We did not encounter special difficulties induces by Tatoo’s specific architecture compared with SableCC used previous years. However, we still have to implement a parser for a real language such as Java or C and to perform benchmarks to prove usefulness of Tatoo features. In order to enhance Tatoo usability, we plan to support complete EBNF specification. Second, we also want to add 19
automatic documentation comparable to Javadoc in input specifications. Finally, other language back-ends, such as C++ and C#, will be added. The latest stable version of Tatoo is freely available on the Web and can be downloaded from http://tatoo.univ-mlv.fr/. 6. REFERENCES [1] A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986. [2] Apache Software Foundation. Velocity 1.4 User Guide. http://jakarta.apache.org/velocity/, Jan. 2006. [3] A. Demenchuk. Beaver - a LALR parser generator. http://beaver.sourceforge.net/index.html, 2006. [4] J.E.F.Friedl.Mastering Regular Expressions. O’Reilly, 2 nd edition, July 2002. [5] E. M. Gagnon and L. J. Hendren. SableCC, an object-oriented compiler framework. In Technology of Object-Oriented Languages and Systems, pages 140–154. IEEE Computer Society, 1998. [6] E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995. [7] K. Gerwin. JFlexUser’sManual, July 2005. [8] S.E.Hudson.CUP User’s Manual. Usability Center, Georgia Institute of Technology, July 1999. [9] S. C. Johnson. Yacc: Yet Another Compiler Compiler, 1979. [10] V. Kodaganallur. Incorporating language processing into java applications: A JavaCC tutorial. IEEE Software, 21(4):70–77, Aug. 2004. [11] A. Le Hors and P. Le Hégaret. Document object model level 3 core. http://www.w3.org/DOM/DOMTR, Apr. 2004. [12] M. E. Lesk and E. Schmidt. Lex - a lexical analyzer generator. Technical Report 39, Bell Laboratories, July 1975. [13] T. J. Parr and R. W. Quong. ANTLR: A predicated-LL(k) parser generator. Software Practice and Experience, 25(7):789–810, 1995. [14] Sun Microsystems Inc. Java(TM) architecture for XML binding specification. http://java.sun.com/xml/downloads/jaxb.html, Jan. 2003. 20
Page 1 and 2: Edited by: Ralf Gitzel, Markus Alek
Page 3 and 4: Message from the Chairs Dear confer
Page 5 and 6: Sam Midkiff, Purdue University (USA
Page 7 and 8: Session F: Novel Uses of Java______
Page 10 and 11: The Project Maxwell Assembler Syste
Page 12 and 13: tomated assembler and disassembler
Page 14 and 15: memory address offset mnemonic argu
Page 16 and 17: 5.2 Instruction Templates The assem
Page 18 and 19: ange for a very short restart/debug
Page 20 and 21: Tatoo: an innovative parser generat
Page 22 and 23: In the grammar file an error termin
Page 24 and 25: Figure 3: Push parsers and lexers L
Page 28: Session B Program and Performance A
Page 31 and 32: Table 1: Use of interfaces and deco
Page 33 and 34: Table 3: Comparison of the situatio
Page 35 and 36: will trigger the creation of many n
Page 37 and 38: Appendix A 10 9 8 7 6 5 4 3 2 1 0 1
Page 39 and 40: Throughout this paper, we make no a
Page 41 and 42: instrumented program and obtained t
Page 43 and 44: Figure 5: Investigation of garbage
Page 45 and 46: to the same category—again, this
Page 47 and 48: Investigating Throughput Degradatio
Page 49 and 50: Figure 1: Apache. Throughput degrad
Page 51 and 52: Minor GC Full GC Workload # of Avg.
Page 53 and 54: Figure 6: Comparing memory and pagi
Page 55 and 56: GenRC on the other hand, allows the
Page 58: Session C Mobile and Distributed Sy
Page 61 and 62: ing a continuous buffer for raw dat
Page 63 and 64: the data arrival speed is more impo
Page 65 and 66: public class StreamingClient { publ
Page 67 and 68: importance of β in our aggregation
Page 69 and 70: Enabling Java Mobile Computing on t
Page 71 and 72: A strongly mobile thread has the ab
Page 73 and 74: a context switch occur. The invoked
Page 75 and 76: above phases. Now, the new stack ha
Page 77 and 78:
5 frames 15 frames 25 frames Pure d
Page 79 and 80:
Juxta-Cat: A JXTA-based platform fo
Page 81 and 82:
Figure 1: JXTA Architecture. 3. JUX
Page 83 and 84:
• Send a discovery query to the p
Page 85 and 86:
The best candidate is then the one
Page 87 and 88:
Local Hosts=2 Hosts=4 Hosts=8 Hosts
Page 90:
Session D Resource and Object Manag
Page 93 and 94:
Enterprise Edition (J2EE). It enabl
Page 95 and 96:
As pictured in Figure 4, JDOSecure
Page 97 and 98:
Methods of a PersistenceManager, th
Page 99 and 100:
Datenmodell abstrahiert user role,
Page 101 and 102:
An Extensible Mechanism for Long-Te
Page 103 and 104:
missing object references in the de
Page 105 and 106:
4.2 Mapping the name spaces of the
Page 107 and 108:
(a) (b) ColorSliderPanel0 color
Page 109 and 110:
8. REFERENCES [1] Abu-Ghazaleh, N.,
Page 111 and 112:
permission by process. In other wor
Page 113 and 114:
The processor then refers to the en
Page 115 and 116:
1: // Protection domain 2: struct p
Page 117 and 118:
Table 3: Frequency of JNI calls tha
Page 119 and 120:
[13] Intel Corporation. IA-32 Intel
Page 121 and 122:
01 try { 02 ... 03 } finally { 04 t
Page 123 and 124:
2. FRAMEWORK The Framework for Unif
Page 125 and 126:
ManagedInputStream ResourceGroup Ma
Page 127 and 128:
18. throw ‡ 1. release 17. cleanu
Page 129 and 130:
3. FUTURE WORK The ability to split
Page 131 and 132:
124
Page 133 and 134:
UML sequence diagrams are among the
Page 135 and 136:
diagrams, and behavioral (dynamic)
Page 137 and 138:
the official scripting language for
Page 139 and 140:
Apache's XML Graphics Project. A cu
Page 141 and 142:
Java Debug Interface (JDI). In Revi
Page 143 and 144:
1.3 JML 1.3.1 Overview JML, the Jav
Page 145 and 146:
The Usage of CANAPA is fairly strai
Page 147 and 148:
*@non_null@*/ String str = attribut
Page 149 and 150:
142
Page 151 and 152:
parallel and distributed versions o
Page 153 and 154:
RingElem CextendsRingElem GenPolyno
Page 155 and 156:
RingElem +isZERO():bolean CextendsR
Page 157 and 158:
class constructors with the actual
Page 159 and 160:
plemented via a distributed hash ta
Page 161 and 162:
which are common nowadays. The reus
Page 163 and 164:
Derivative Contract Component Repos
Page 165 and 166:
stepwise execution create Derivativ
Page 167 and 168:
5.4.1 Structural Constraints Struct
Page 169 and 170:
into the conceptual foundation of n
Page 171 and 172:
different implementation and is mor
Page 173 and 174:
the service from the root. It allow
Page 175 and 176:
model: 1. Servlet [6] adapter compo
Page 177 and 178:
y possibly different service, where
Page 179 and 180:
or the fact that widgets extend ser
Page 181 and 182:
174
Page 183 and 184:
The idea of Java 5.0 type inference
Page 185 and 186:
Source := (class | interface)∗ cl
Page 187 and 188:
5. IMPLEMENTATION In order to prese
Page 189 and 190:
Infinite Streams in Java Dominik Gr
Page 191 and 192:
} private static LinkedStream fibon
Page 193 and 194:
of the f stream in order to compute
Page 195 and 196:
Interaction among Objects via Roles
Page 197 and 198:
(a) (b) (c) (d) (e) Figure 1: The p
Page 199 and 200:
class Printer { private int totalPr
Page 201 and 202:
Experiences of using the Dagstuhl M
Page 203 and 204:
Metric Definition Java .class files
Page 205 and 206:
scription of the metric values. Non
Page 207 and 208:
Figure 1: Results from the J-vestig
Page 209 and 210:
an error is subsequently generated
Page 211 and 212:
3. BASIC TERMINOLOGY As object-orie
Page 213 and 214:
• subtyping • (implementation)
Page 215 and 216:
Improving the Quality of Programmin
Page 217 and 218:
Results of online checks (shortened
Page 219 and 220:
212
Page 221 and 222:
214
Page 223 and 224:
Experiences With Hierarchy-Based Co
Page 225 and 226:
Sub View Child DataField 0..n Ke
Page 227 and 228:
Figure 8 - Actual State Charts elem
Page 229 and 230:
associations, which may result in r
Page 231 and 232:
M3PS: A Multi-Platform P2P System B
Page 233 and 234:
In following, we will explain in de
Page 235 and 236:
Figure 10. JDP in Windows XP. Figur
Page 237 and 238:
Mapping Clouds of SOA- and Business
Page 239 and 240:
the technical SOA events (from the
Page 241 and 242:
component and the business process
Page 243 and 244:
Figure 13. “Business Value of Dat
Page 245 and 246:
Solaris of SUN. This platform provi
Page 247 and 248:
status change of an application is
Page 249 and 250:
coming up, is presently discussing
Page 251:
ISBN: 3-939352-05-5 ISBN: 978-3-939
show all

4th International Conference on Principles and Practices ... - MADOC

Create successful ePaper yourself

Delete template?

Save as template?