19 search results - page 1 / 4 » Scannerless Boolean Parsing |
ENTCS
2006
13 years 4 months ago
2006
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
CC
2002
Springer
13 years 4 months ago
2002
Springer
In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax definitions in which all aspects (lexical and context-free) ...
ENTCS
2010
13 years 1 months ago
2010
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine d...
JACM
2002
13 years 4 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
GPCE
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such ...