summaryrefslogtreecommitdiffstats
path: root/parser.sml
AgeCommit message (Collapse)AuthorFilesLines
2024-06-08Add structures.Rose Hogenson1-6/+18
2024-05-18Improve support for infix operators.Rose Hogenson1-59/+122
2024-05-18Allow pattern matching in function definitions.Rose Hogenson1-9/+14
2024-05-17Add datatypes.Rose Hogenson1-3/+20
2024-05-05Add tuples.Rose Hogenson1-1/+5
2024-05-04Add "fun" syntax.Rose Hogenson1-9/+19
2024-05-04Implement recursive functions.Rose Hogenson1-1/+5
2024-04-28Add case over int.Rose Hogenson1-8/+18
2024-04-07Add tests and fix variables.Rose Hogenson1-1/+6
2024-02-19Support function arguments.Rose Hogenson1-20/+35
2023-02-12Add lambda functions.Rose Hogenson1-1/+4
2023-02-11Finish the compiler.Rose Hogenson1-37/+37
Just joking. But we did manage to compile a program from SML to bytecode.
2023-02-10Add module syntax to the parser.Rose Hogenson1-16/+94
2022-09-12Get rid of the Y combinator.Rose Hogenson1-73/+72
It's a bit overcomplicated. We can rely on the fact that parsers are functions.
2022-09-11Don't break the parser abstraction for recursion.Rose Hogenson1-37/+44
Parsers are values. Of course, one can always make recursion from scratch even if the language doesn't allow recursive values.
2022-09-11Fix a performance issues in parser.sml.Rose Hogenson1-3/+3
2022-09-11Add a simple expression parser.Rose Hogenson1-0/+352