Gateway Software Symposium
March 7 - 9, 2008 - St. Louis, MO
Mark Volkmann
Software Consultant and Partner at OCI
Mark Volkmann has been a software consultant for Object Computing, Inc. (OCI) in St. Louis since 1996. He has been developing software in Java since 1995.
Mark has created and teaches many courses in Java, XML and Ruby. They include: Introduction to Java, Java Syntax for Non-C Programmers, Java Programming, Advanced Java Programming, Creating Graphical User Interfaces Using Java (Swing), eXtensible Markup Language (XML), XML Programming Using Java and Web Services Using Java, and Ruby Programming.
Mark is a member of the St. Louis Java User Group steering committee and a regular presenter for that group. He has written for XML Journal. Mark has also presented at XML DevCon conferences, No Fluff Just Stuff Java symposiums
and the St. Louis Ruby User Group.
Presentations
Implementing Languages with ANTLR 3
ANTLR 3 (http://antlr.org) is a Java-based tool that generates language parsers in a variety of programming languages including Java. This talk will walk through implementation of a domain-specific language (DSL) using ANTLR.
ANTLR differs from most other parser generators in that it supports unlimited lookahead to select between grammar rule alternatives.
While languages such a Ruby and Groovy can also be used to implement DSLs, they bring with them the baggage of their own syntax rules. ANTLR allows you to make the syntax of your DSL be exactly what you want to be.
We'll start with lexer rules to break a character stream into tokens, write parser rules that build an abstract syntax tree, and write tree parser rules that walk the AST and execute the code that was fed to the lexer.
We'll also demonstrate use of ANTLRWorks which is a free graphical editor and debugger for ANTLR grammars. It is particularly useful in stepping through the construction of ASTs.
After attending this talk you'll be ready to begin using ANTLR to implement your own languages.
ANTLR differs from most other parser generators in that it supports unlimited lookahead to select between grammar rule alternatives.
While languages such a Ruby and Groovy can also be used to implement DSLs, they bring with them the baggage of their own syntax rules. ANTLR allows you to make the syntax of your DSL be exactly what you want to be.
We'll start with lexer rules to break a character stream into tokens, write parser rules that build an abstract syntax tree, and write tree parser rules that walk the AST and execute the code that was fed to the lexer.
We'll also demonstrate use of ANTLRWorks which is a free graphical editor and debugger for ANTLR grammars. It is particularly useful in stepping through the construction of ASTs.
After attending this talk you'll be ready to begin using ANTLR to implement your own languages.
