Results 1 
5 of
5
Scannerless Boolean Parsing
, 2006
"... Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing programming languages at the character level, disambiguation extensions beyond the usual contextfree formalism are required. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing programming languages at the character level, disambiguation extensions beyond the usual contextfree formalism are required.
Generalized bottom up parsers with reduced stack activity
 The Computer Journal
"... We describe a generalized bottom up parser in which nonembedded recursive rules are handled directly by the underlying automaton, thus limiting stack activity to the activation of rules displaying embedded recursion. Our strategy is motivated by Aycock and Horspool’s approach, but uses a different ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We describe a generalized bottom up parser in which nonembedded recursive rules are handled directly by the underlying automaton, thus limiting stack activity to the activation of rules displaying embedded recursion. Our strategy is motivated by Aycock and Horspool’s approach, but uses a different automaton construction and leads to parsers that are correct for all contextfree grammars, including those with hidden left recursion. The automaton features edges which directly connnect states containing reduction actions with their associated goto state: hence we call the approach reduction incorporated generalized LR parsing. Our parser constructs shared packed parse forests in a style similar to that of Tomita parsers. We give formal proofs of the correctness of our algorithm, and compare it with Tomita’s algorithm in terms of the space and time requirements of the running parsers and the size of the parsers ’ tables. Experimental results are given for standard grammars for ANSIC, ISOPascal; for a nondeterministic grammar for IBM VSCOBOL, and for a small grammar that triggers asymptotic worst case behaviour in our parser. 1.
Generalised LR parsing algorithms
, 2006
"... This thesis concerns the parsing of contextfree grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not. An algorithm that is capable of parsing any contextfree grammar ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This thesis concerns the parsing of contextfree grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not. An algorithm that is capable of parsing any contextfree grammar is called a generalised (contextfree) parser. This thesis is devoted to the theoretical analysis of generalised parsing algorithms. We describe, analyse and compare several algorithms that are based on Knuth’s LR parser. This work underpins the design and implementation of the Parser Animation Tool (PAT). We use PAT to evaluate the asymptotic complexity of generalised parsing algorithms and to develop the Binary Right Nulled Generalised LR algorithm – a new cubic worst case parser. We also compare the Right Nullable Generalised LR, Reduction Incorporated Generalised LR, Farshi, Tomita and Earley algorithms using the statistical data collected by PAT. Our study indicates that the overheads associated with some of the parsing algorithms may have significant consequences on their behaviour.
Sparse Table Composition  Separate Compilation and Binary Extensibility of Grammars
, 2008
"... ..."
sbp: A Scannerless Boolean Parser
 LDTA 2006 PRELIMINARY VERSION
, 2006
"... Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse (disambiguate) existing programming languages, extensions beyond the usual contextfree formalism must be added to handle a number of spe ..."
Abstract
 Add to MetaCart
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse (disambiguate) existing programming languages, extensions beyond the usual contextfree formalism must be added to handle a number of specific cases. This paper describes sbp, a scannerless parser for boolean grammars, a superset of contextfree grammars. In this expanded formalism, specialpurpose disambiguation constructs become special cases of a broader formalism, yet all grammars admit O(n 3) parsers using a derivitave of the LangTomita algorithm. The implementation is publicly available as Java source code.