Sciweavers

553 search results - page 4 / 111
» Verified, Executable Parsing
Sort
View
IWPT
2001
14 years 11 months ago
Bidirectional Automata for Tree Adjoining Grammars
We define a new model of automata for the description of bidirectional parsing strategies for tree adjoining grammars and a tabulation mechanism that allow them to be executed in ...
Miguel A. Alonso, Víctor J. Díaz, Ma...
63
Voted
CC
2001
Springer
125views System Software» more  CC 2001»
15 years 2 months ago
Directly-Executable Earley Parsing
John Aycock, R. Nigel Horspool
GPCE
2007
Springer
15 years 1 months ago
Context-aware scanning for parsing extensible languages
This paper introduces new parsing and context-aware scanning algorithms in which the scanner uses contextual information to disambiguate lexical syntax. The parser uses a slightly...
Eric Van Wyk, August Schwerdfeger
ENTCS
2008
139views more  ENTCS 2008»
14 years 9 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova
78
Voted
DLS
2008
213views Languages» more  DLS 2008»
14 years 11 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