Connect the Laurel abstract syntax tree with a parser, supporting just AssertFalse.lr.st #242
Description
Let's try to use the DDM, so we'll have:
- A file that defines a Laurel dialect using DDM syntax. I think ideally this is not a .lean file but is purely DDM syntax, so it will be easier to parse by Java code that'll generate Java types.
- A grammar test that uses the AssertFalse.lr.st file as input, parses it using the dialect definition, and prints it back out again. We can test that the same non-whitespace characters are still there.
- A transformation from the concrete Laurel syntax to the abstract one