A note on ambiguity in context-free grammars

DOI10.1016/0020-0190(90)90058-6zbMATH Open0697.68066OpenAlexW2027838887MaRDI QIDQ911784FDOQ911784

Tom Altman, George Logothetis

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90058-6

Recommendations

• Analyzing Ambiguity of Context-Free Grammars
• Analyzing ambiguity of context-free grammars
• scientific article; zbMATH DE number 1067868
• An undecidable problem for context-free grammars
• The inherent ambiguity partial algorithm problem for context free languages

zbMATH Keywords

ambiguityformal languagestheory of computation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Three models for the description of language
• Title not available (Why is that?)
• Title not available (Why is that?)
• On certain formal properties of grammars
• Title not available (Why is that?)
• The undecidability of the ambiguity problem for minimal linear grammars
• Title not available (Why is that?)
• On The Ambiguity Problem of Backus Systems

Cited In (11)

• Conservative Ambiguity Detection in Context-Free Grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• The inherent ambiguity partial algorithm problem for context free languages
• Title not available (Why is that?)
• Exponential ambiguity of context-free grammars
• Equivalent conversions of ambiguous context-free grammars
• Analyzing Ambiguity of Context-Free Grammars
• Title not available (Why is that?)
• An ambiguity hierarchy of weighted context-free grammars
• Finite generation of ambiguity in context-free languages

This page was built for publication: A note on ambiguity in context-free grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911784)