Scannerless Boolean Parsing

Megacz, Adam

doi:10.1016/j.entcs.2006.10.007

Cited by 4 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In general, conjunctive and Boolean grammars should not be difficult to implement in existing projects, since the widely used GLR parsing algorithm can handle conjunctive and Boolean rules [21,31]. Besides parsing algorithms, no other essential grammar technologies and tools have yet been developed for Boolean grammars.…”

Section: Afterthoughtsmentioning

confidence: 99%

“…The most practical parsing algorithm for Boolean grammars is a variant of the Generalized LR (GLR) [31], which runs in worst-case time O(n 4 ) and operates very similarly to the GLR for ordinary grammars [45]. Two implementations of Boolean GLR are known [21,26]. In the literature, GLR parsers have sometimes been applied to analyzing programming languages symbol by symbol, without an intermediate layer of lexical analysis [8,10,17]: this is known as scannerless parsing [38].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Describing the syntax of programming languages using conjunctive and Boolean grammars

Okhotin

2020

Preprint

View full text Add to dashboard Cite

A classical result by Floyd ("On the non-existence of a phrase structure grammar for ALGOL 60", 1962) states that the complete syntax of any sensible programming language cannot be described by the ordinary kind of formal grammars (Chomsky's "context-free"). This paper uses grammars extended with conjunction and negation operators, known as conjunctive grammars and Boolean grammars, to describe the set of well-formed programs in a simple typeless procedural programming language. A complete Boolean grammar, which defines such concepts as declaration of variables and functions before their use, is constructed and explained. Using the Generalized LR parsing algorithm for Boolean grammars, a program can then be parsed in time O(n 4 ) in its length, while another known algorithm allows subcubic-time parsing. Next, it is shown how to transform this grammar to an unambiguous conjunctive grammar, with square-time parsing. This becomes apparently the first specification of the syntax of a programming language entirely by a computationally feasible formal grammar.

show abstract

Section: Afterthoughtsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Describing the syntax of programming languages using conjunctive and Boolean grammars

Okhotin

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Extending the parsing schemata formalisation to work with Boolean grammars can be done in a similar style to generalising any other particular particular parsing technique to work with Boolean grammars [22], [28], [29], [30], [38]. Armed with such a combined methodology, we plan to construct a parsing schema for each of the semi-parsing methods listed before in subsection II-A.…”

Section: Proposed Methodsmentioning

confidence: 99%

“…Technical support for Boolean grammars includes parsing algorithms in the styles of recursive descent [29], LL(k) [30], LR [28], SGLR/RNGLR [22] and TXL parse views [38].…”

Section: B Boolean Grammarsmentioning

confidence: 99%

Formal foundations for semi-parsing

Zaytsev

2014

2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering, and Reverse Engineering (CSMR-WCRE)

View full text Add to dashboard Cite

Abstract-There exist many techniques for imprecise manipulation of source code (robust parsing, error repair, lexical analysis, etc), mostly relying on heuristic-based tolerance. Such techniques are rarely fully formalised and quite often idiosyncratic, which makes them very hard to compare with respect to their applicability, tolerance level and general usefulness. With a combination of recently developed formal methods such as Boolean grammars and parsing schemata, we can model different tolerant methods of modelling software and formally argue about relationships between them.

show abstract

Recursive descent parsing for Boolean grammars

Okhotin

2007

Acta Informatica

View full text Add to dashboard Cite

Scannerless Boolean Parsing

Cited by 4 publications

References 11 publications

Describing the syntax of programming languages using conjunctive and Boolean grammars

Describing the syntax of programming languages using conjunctive and Boolean grammars

Formal foundations for semi-parsing

Recursive descent parsing for Boolean grammars

Contact Info

Product

Resources

About