Timeline for Is this a correct grammar for untyped lambda calculus?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 20, 2018 at 1:16 | vote | accept | Jan Parzydło | ||
| Nov 19, 2018 at 20:55 | comment | added | chi | @JanParzydło TERM expands into either APPLICATION or ABSTRACTION. Only the latter begins with LAMBDA. So, if you see LPAREN, you try APPLICATION. | |
| Nov 19, 2018 at 19:27 | comment | added | Jan Parzydło | Thanks for your response. The reason I asked for the parse tree is because I'm having trouble understanding how a parser would determine that the outermost TERM expands into APPLICATION. Is this possible to do using 1-token lookup? | |
| Nov 19, 2018 at 19:17 | history | answered | chi | CC BY-SA 4.0 |