An LALR Extension for DCGs in Dynamic Programming

We propose a parsing model for DCGs. Our work embodies in a common frame a dynamic programming construction developed for logical push-down automata, and techniques that restrict the computation to a useful part of the search space, inspired by LALR parsing. Unlike preceding approaches, our proposal avoids backtracking in all cases, providing computational sharing and operational completeness for DCGs without functional symbols.