 Thomas Pelletier
|
590d7faf65
|
Parser emits AST node for all kinds of strings
|
2021-03-14 16:16:29 -04:00 |
|
|
Thomas Pelletier
|
de035f0fed
|
Standard tables in parser
|
2021-03-14 16:11:23 -04:00 |
|
|
Thomas Pelletier
|
04925e4882
|
Handle bools
|
2021-03-14 15:52:22 -04:00 |
|
|
Thomas Pelletier
|
3760527218
|
Unmarshal tests
|
2021-03-13 23:42:38 -05:00 |
|
|
Thomas Pelletier
|
fa7ee6461a
|
Inline tables
|
2021-03-13 23:06:16 -05:00 |
|
|
Thomas Pelletier
|
fbf01f7683
|
Handle Table
|
2021-03-13 22:48:31 -05:00 |
|
|
Thomas Pelletier
|
a0548e793c
|
Unmarshal slices of strings
|
2021-03-13 22:07:36 -05:00 |
|
|
Thomas Pelletier
|
d8be04d4a8
|
Handle simple string slice
|
2021-03-13 18:45:03 -05:00 |
|
|
Thomas Pelletier
|
21d3e85fcc
|
Playing with an AST
Idea would be to build a light AST as a first pass, then have the
unmarshaler and Document parser do what they need with it.
|
2021-03-13 11:38:09 -05:00 |
|