A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars
Journal of the ACM (JACM)
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
An efficient context-free parsing algorithm
An efficient context-free parsing algorithm
Flexible in-lined reference monitor certification: challenges and future directions
Proceedings of the 5th ACM workshop on Programming languages meets program verification
A language specification tool for model-based parsing
IDEAL'11 Proceedings of the 12th international conference on Intelligent data engineering and automated learning
Hi-index | 0.00 |
A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(k) algorithm and the familiar top-down algorithm. It has a time bound proportional to n3 (where n is the length of the string being parsed) in general; it has an n2 bound for unambiguous grammars; and it runs in linear time on a large class of grammars, which seems to include most practical context-free programming language grammars. In an empirical comparison it appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.