Affiliation:
1. System Development Corporation, Santa Monica, California
Abstract
Four principal results about ambiguity in languages (i.e., context free languages) are proved. It is first shown that the problem of determining whether an arbitrary language is inherently ambiguous is recursively unsolvable. Then a decision procedure is presented for determining whether an arbitrary bounded grammar is ambiguous. Next, a necessary and sufficient algebraic condition is given for a bounded language to be inherently ambiguous. Finally, it is shown that no language contained in
w
1
*
w
2
*, each
w
1
a word, is inherently ambiguous.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference15 articles.
1. On forraal properties of simple phrase structure grammars;BAR-HILLEEL RLES;Z. Phonetik. Sprachwiss. Kommunikationsforsch.,1961
2. On The Ambiguity Problem of Backus Systems
3. On certain formal properties of grammars;Inform. Control.,1959
4. models for the description of language;IRE Trans. on Information Theory,1956
Cited by
100 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. AI Coders Are among Us: Rethinking Programming Language Grammar towards Efficient Code Generation;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11
2. The Pumping Lemma for Context-Free Languages is Undecidable;Lecture Notes in Computer Science;2024
3. Cellular Automata: Communication Matters;Lecture Notes in Computer Science;2024
4. On Languages Generated by Signed Grammars;Electronic Proceedings in Theoretical Computer Science;2023-09-15
5. Statically Resolvable Ambiguity;Proceedings of the ACM on Programming Languages;2023-01-09