Timeline for When generating a PDA from a CFG do I have a receiving state?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 16, 2012 at 8:51 | comment | added | Luke Mathieson | Yeah, I guess calling it an "abuse of notation" is a little harsh. though aesthetically, I think the one-symbol-at-a-time model is nicer, in the sense that it feels closer to a restricted Turing Machine. I blame having Sipser as a textbook as an undergraduate. (Of course it's really just a trivial change with some intermediate states) | |
| Aug 16, 2012 at 7:23 | comment | added | Raphael | The PDA definitions I know allow pushing of multiple symbols at once. The key here is the (relative to NFA) additional acceptance criterion "empty stack". Also, one can think of this construction as nondeterministic recursive descent parsing. | |
| Aug 16, 2012 at 2:02 | history | answered | Luke Mathieson | CC BY-SA 3.0 |