A New Method for Dependent Parsing

Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify common features that cannot be handled by context-free grammars, such as length fields in data formats and significant indentation in programming languages. Few parser generators support dependent parsing, however. To address this shortcoming, we have developed a new method for implementing dependent parsers by extending existing parsing algorithms. Our method proposes a point-free language of dependent grammars, which we believe closely corresponds to existing context-free parsing algorithms, and gives a novel transformation from conventional dependent grammars to point-free ones. To validate our technique, we have specified the semantics of both source and target dependent grammar languages, and proven our transformation sound and complete with respect to those semantics. Furthermore, we have empiricall...

• Type: Journal
• Year: 2011
• Where: ESOP
• Authors: Trevor Jim, Yitzhak Mandelbaum
• Keywords: Context Free Grammars, ESOP 2011, Grammar Languages, Parser Generators, Programming Languages