Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion

Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute dependencies. A memoization technique is used with this non-strict method for efficiently processing ambiguous input. This one-pass approach allows Natural Language (NL) processors to be constructed as executable, modular and declarative specifications of Attribute Grammars.

• Type: Conference
• Year: 2009
• Where: AI
• Authors: Rahmatullah Hafiz
• Keywords: AI 2009, Ambiguous Context-free Grammar, Arbitrary Attribute Dependencies, Artificial Intelligence, Top-down Parsing Algorithm