9 search results - page 1 / 2 » Removing Left Recursion from Context-Free Grammars |
ANLP
2000
13 years 6 months ago
2000
A long-standing issue regarding algorithms that manipulate context-free grammars (CFGs) in a "top-down" leftto-right fashion is that left recursion can lead to nontermin...
AAAI
2011
12 years 4 months ago
2011
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
CPP
2011
12 years 4 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
FLAIRS
2003
13 years 6 months ago
2003
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biase...
ACL
1997
13 years 6 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...