Go to file
Devine Lu Linvega f2e1b60f99 Renamed memory banks 2024-04-06 08:21:14 -07:00
examples Updated arithmetic example with wryls fixes 2024-04-05 21:55:35 -07:00
old Organized things a bit 2024-04-04 15:33:22 -07:00
src Renamed memory banks 2024-04-06 08:21:14 -07:00
.clang-format Trying a c parser 2024-04-04 09:04:27 -07:00
.gitignore Trying a c parser 2024-04-04 09:04:27 -07:00
README.md Organized things a bit 2024-04-04 15:33:22 -07:00
makefile Register reassignment 2024-04-05 10:34:46 -07:00

README.md

Modal

Modal is a language based a model of computation that uses pattern matching and replacement to rewrite trees.

All Modal code is represented as a series of rules applied to a given tree, formatted textually as tokens delimited with parenthesis, which gets continually modified until no rules match any given part of the tree.

A pattern/replacement can be:

A token: foo, bar, baz
A variable: ?foo, ?bar, ?baz
A sequence of the above: (foo bar baz), (foo ?bar baz), foo (bar (baz))

Build

cc src/modal.c -o bin/modal

Run

bin/modal examples/hello.modal

Credits

Created by wryl, Immediate Mode Technologies.