The inherent ambiguity partial algorithm problem for context free languages

Authors:
Joseph S. Ullian
Affiliations:
Washington University, St. Louis, Missouri and System Development Corporation, Sata Monica, California
Venue:
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Year:
1969

Citing 2
Cited 0

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that there is no “partial algorithm” (effective procedure that may fail to terminate) by which, given a context free grammar, one can always find an unambiguous context free grammar generating the same language if such an unambiguous grammar exists. The argument turns on the degree of unsolvability of the inherent ambiguity problem for context free languages.