Weak and Mixed Strategy Precedence Parsing
- 1 April 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 19 (2), 225-243
- https://doi.org/10.1145/321694.321697
Abstract
$+ $ • ! T ) ( + $ • ~ .> .> .> • > .> .> .~ $ $ ! .> .> > > > ) > ( < < < < =" < < + < < ~ < < , =. < < $ < < < < < < =' .> • > .> > • > -> > -> > • > .> > • > .> > $ < • = < < --" < < .> < < .> .> .> + w. []
Keywords
This publication has 9 references indexed in Scilit:
- A technique for generating almost optimal Floyd-Evans productions for precedence grammarsCommunications of the ACM, 1970
- An efficient context-free parsing algorithmCommunications of the ACM, 1970
- Total Precedence RelationsJournal of the ACM, 1970
- A new method for determining linear precedence functions for precedence grammarsCommunications of the ACM, 1969
- Deterministic context free languagesInformation and Control, 1966
- EULER: A generalization of ALGOL and its formal definition: Part 1Communications of the ACM, 1966
- On the translation of languages from left to rightInformation and Control, 1965
- Bounded context syntactic analysisCommunications of the ACM, 1964
- Syntactic Analysis and Operator PrecedenceJournal of the ACM, 1963