Timeline for Unambiguous but nondeterministic context-free language?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| May 27, 2015 at 19:30 | comment | added | ithisa | I rather meant "parse without complaining about shift/reduce conflicts". | |
| May 27, 2015 at 7:45 | comment | added | babou | @user54609 AFAIK, Yacc will parse a lot of languages that are not deterministic, or grammars that are not LR(k). It makes choices, when it has to (with consequences you may guess). But I am not a big Yacc user, so you should rather check the Yacc literature,. | |
| May 27, 2015 at 1:04 | comment | added | ithisa |
So the language $ww^R$ does not have deterministic grammar? That's very interesting (so yacc shouldn't be able to parse it?)
|
|
| May 27, 2015 at 1:03 | vote | accept | ithisa | ||
| May 23, 2015 at 20:35 | history | edited | babou | CC BY-SA 3.0 |
added 207 characters in body
|
| May 23, 2015 at 19:21 | history | answered | babou | CC BY-SA 3.0 |