7 search results - page 1 / 2 » Recursive descent parsing for Boolean grammars |
ACTA
2007
13 years 4 months ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
FUIN
2007
13 years 4 months ago
2007
Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in ter...
ESOP
2010
Springer
13 years 8 months ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
SIGCSE
2005
ACM
13 years 10 months ago
2005
ACM
We provide a systematic transformation of an LL(1) grammar to an object model that consists of · an object structure representing the non-terminal symbols and their corresponding...
ICFP
2002
ACM
14 years 4 months ago
2002
ACM
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...