Timeline for Recursive-Descent Predictive Parser for $S \rightarrow 0S1\ |\ 01$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 5, 2012 at 22:00 | history | edited | Luke Mathieson | CC BY-SA 3.0 |
added 269 characters in body
|
| Nov 5, 2012 at 15:16 | history | edited | Gilles 'SO- stop being evil' | CC BY-SA 3.0 |
tweaked misleading opening sentence; formatting
|
| Nov 5, 2012 at 10:44 | comment | added | Luke Mathieson | @Raphael: You're quite right, despite writing LL(K), I was thinking of LL(1). The simplicity of the grammar tricked me ;). | |
| Nov 5, 2012 at 8:10 | comment | added | Raphael | "You need to modify the grammar." -- what's wrong with giving the "naive" recursive descent parser one additional symbol lookahead? | |
| Nov 5, 2012 at 5:19 | history | edited | Luke Mathieson | CC BY-SA 3.0 |
added 3 characters in body
|
| Nov 5, 2012 at 4:45 | history | answered | Luke Mathieson | CC BY-SA 3.0 |