11th Annual Symposium on Switching and Automata Theory (swat 1970) (1970)
Oct. 28, 1970 to Oct. 30, 1970
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWAT.1970.23
Syntactic clues are aids to parsing. The amount of nondeterminism in parsers for pairs of homomorphically related semithue language systems is compared. If the parsers are without lookahead, the domain language system parser has no more nondeterminism than the codomain language system parser. The domain language system has at least as many clues. If the parsers have lookahead and the homomorphism is nondecreasing the same results hold. If the homomorphism is nonincreasing, an example shows the codomain language system may have the better clues.
D. B. Benson, "Syntactic clues," 11th Annual Symposium on Switching and Automata Theory (swat 1970)(FOCS), vol. 00, no. , pp. 133-138, 1970.