Sciweavers

226 search results - page 1 / 46
» A parsing machine for PEGs
Sort
View
DLS
2008
213views Languages» more  DLS 2008»
13 years 6 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy
FUIN
2007
138views more  FUIN 2007»
13 years 4 months ago
Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking
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...
Roman R. Redziejowski
ESOP
2010
Springer
13 years 8 months ago
TRX: A Formally Verified Parser Interpreter
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...
Adam Koprowski, Henri Binsztok
POPL
2004
ACM
14 years 5 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
FUIN
2008
102views more  FUIN 2008»
13 years 4 months ago
Some Aspects of Parsing Expression Grammar
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a top-down process with limited backtracking. It can be directly transcribed into a recursive-descent ...
Roman R. Redziejowski