An algorithm is described which constructs from a suitable BNF grammar an efficient left-right recognizer for sentences of the corresponding language. The type of recognizer, used in a number of compilers, operates with a pushdown stack and with a transition matrix. Two examples illustrate how such recognizers may be used effectively for other purposes besides the usual syntax checking.
No takes yet. Share an insight, caveat, or question.
David Gries (1968) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: