| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2024-09-25 | Can parse and evaluate multiple expressions from a single input | Arnaud Bailly | |
| 2024-09-25 | Prepare parser to return multiple values | Arnaud Bailly | |
| 2024-09-25 | Evaluate both side of application | Arnaud Bailly | |
| 2024-09-24 | Inline next token advance | Arnaud Bailly | |
| 2024-09-24 | Parse abstractions | Arnaud Bailly | |
| Got tricked with or()'s function eagerness: Even when the left hand side succeeds, the argument was evaluated which consumed a token in the parser which prevented proper parsing. | |||
| 2024-09-24 | Introduce recursive descent parser | Arnaud Bailly | |
| 2024-09-24 | Tokenize λ | Arnaud Bailly | |
| 2024-09-24 | Main prints result of interpreter | Arnaud Bailly | |
| 2024-09-24 | Parse binary application with parens | Arnaud Bailly | |
| 2024-09-24 | Introduce explicit Token type and parse parens | Arnaud Bailly | |
| 2024-09-24 | Check parsing is inverse to display | Arnaud Bailly | |
| 2024-09-24 | Tokenize a sequence of whitespace separated values | Arnaud Bailly | |
| 2024-09-24 | Push down tests at parser level | Arnaud Bailly | |
| Interpret now is a Value-transforming function | |||
| 2024-09-24 | Split module into ast and parser | Arnaud Bailly | |
 |
index : lambda-nantes | |
| Unnamed repository; edit this file 'description' to name the repository. |
| summaryrefslogtreecommitdiff |