Scannerless Boolean Parsing

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 context-free formalism are required. This paper explains how scannerless parsers for boolean grammars (context-free grammars extended with intersection and negation) can specify such languages unambiguously, and can also describe other interesting constructs such as indentationbased block structure. The sbp package implements this parsing technique and is publicly available as Java source code. Key words: boolean grammar, scannerless, GLR

• Type: Journal
• Year: 2006
• Where: ENTCS
• Authors: Adam Megacz
• Keywords: Boolean Grammar, Context-free Grammars, ENTCS 2006, Usual Context-free Formalism