Welcome | |
Teaching | |
Research | |
Projects | |
CV | |
Contact info | |
Other stuff | |
Links |
We present a new parser generator called aperiot based on grammar transformation. This approach retains the complexity and performance advantages of LL(1) parsers while allowing to parse a large set of non-LL(1) grammars and without imposing a lookahead limit. We demonstrate the practicality of this approach with a case-study of a realistic language.
The text are available in the following formats: