Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Questions about ambiguity in context-free grammars.
6
votes
1
answer
251
views
Hardness of ambiguity/non-ambiguity for context-free grammars
Moreover, at least one of ambiguity and
non-ambiguity cannot even be recursively enumerable, for otherwise
ambiguity of a given CFG $G$ could be decided by running the
enumeration of ambiguity and non-ambiguity … Ambiguity or non-ambiguity?
D. G. Cantor, On The Ambiguity Problem of Backus Systems.
R. W. Floyd, On ambiguity in phrase structure languages. …