language-frontend, branch masterToy language lexerhttp://git.nelin.dk/language-frontend/atom?h=master2026-09-22T21:31:45Zfix: check for consequtive n-ary expressions2026-09-22T21:31:45Zonelinoscar@nelin.dk2026-09-22T21:31:45Zurn:sha1:9908a38ec32dea9d6808164073b652216bf74e4bUpdate program.input2026-09-22T21:27:57Zonelinoscar@nelin.dk2026-09-22T21:23:52Zurn:sha1:5bcc3382fc3b3299186d941dde16a35c9bb4281bUpdate example program2026-09-22T21:27:57Zonelinoscar@nelin.dk2026-09-22T21:22:52Zurn:sha1:dbc459da354948522d8cd7488d71b04b8c18fa28Update documentation on how parsing is done without recursion2026-09-22T21:27:55Zonelinoscar@nelin.dk2026-09-22T21:22:38Zurn:sha1:381bf1c8481276c5ee6318e6694bb2ee151a54b7chore: Refactor readability of parser2026-09-22T21:21:33Zonelinoscar@nelin.dk2026-09-22T21:21:33Zurn:sha1:357c336082b176c6734d9f78da4640644b3772d0
Also fix how precedence is checked
docs: Update readme and roadmap2026-09-22T20:46:56Zonelinoscar@nelin.dk2026-09-22T20:46:56Zurn:sha1:6cb929f1d70a5a832971b6d8c6558ea5376ecee8Fix off-by-one allocation and 0-terminating buffer, amongst memory cleanup2026-09-22T20:46:24Zonelinoscar@nelin.dk2026-09-22T20:46:24Zurn:sha1:a7393edb53560cfafb213eaf9e6d11af55c33047chore: Cleanup2026-09-22T16:13:57Zonelinoscar@nelin.dk2026-09-22T16:13:43Zurn:sha1:5b29903b6370a5fbca89ac305c865f1956848ee3Document parser2026-09-22T15:17:26Zonelinoscar@nelin.dk2026-09-22T15:17:26Zurn:sha1:0d78ac413234479d552494a23fb0e6978b0269f3Update parser2026-09-22T15:16:51Zonelinoscar@nelin.dk2026-09-22T15:16:51Zurn:sha1:3defc8399e32b460bfe17f7e2a386fa159c8f702
It will now construct an AST of the tokens