Timeline for How is this grammar LL(1)?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2012 at 20:45 | answer | added | Ethan | timeline score: 10 | |
| Nov 20, 2012 at 5:42 | vote | accept | Vinayak Garg | ||
| Nov 19, 2012 at 21:44 | answer | added | Alex ten Brink | timeline score: 11 | |
| Nov 19, 2012 at 19:49 | history | tweeted | twitter.com/#!/StackCompSci/status/270614987544875008 | ||
| Nov 19, 2012 at 18:22 | history | edited | Raphael | CC BY-SA 3.0 |
edited tags
|
| Nov 19, 2012 at 16:54 | answer | added | AProgrammer | timeline score: 0 | |
| Nov 19, 2012 at 14:49 | review | First posts | |||
| Nov 19, 2012 at 20:26 | |||||
| Nov 19, 2012 at 14:45 | comment | added | Vinayak Garg | @Nejc: Yes it does seems like that! | |
| Nov 19, 2012 at 14:44 | comment | added | Nejc | I am not very fammiliar with grammars, but it seems that language of this grammar is finite. $L=\{ab,ba\}$ | |
| Nov 19, 2012 at 14:39 | history | edited | A.Schulz | CC BY-SA 3.0 |
added 31 characters in body; edited tags
|
| Nov 19, 2012 at 14:30 | history | asked | Vinayak Garg | CC BY-SA 3.0 |