Eelco Dolstra
|
06ae269c7c
|
* Do not filter when parsing. This is much faster.
* Add some rejections and lexical restrictions to the grammar to make
this work.
|
2003-11-10 11:00:38 +00:00 |
|
Eelco Dolstra
|
e2655aa332
|
* Shorter list syntax ([a b c] instead of [a, b, c]).
|
2003-11-03 11:59:35 +00:00 |
|
Eelco Dolstra
|
ad0976f8d5
|
* Grammar changes. Attributes in attribute sets are now delimited with
semicolons instead of comma's. Final semicolon in the set is optional.
|
2003-11-03 10:21:30 +00:00 |
|
Eelco Dolstra
|
40986312bb
|
* Boolean constants.
|
2003-11-02 17:36:15 +00:00 |
|
Eelco Dolstra
|
9210d4d530
|
* Working evaluator.
* Mutually recursive attribute sets.
* Print evaluator efficiency statistics.
|
2003-10-31 17:09:31 +00:00 |
|
Eelco Dolstra
|
7db08cc924
|
* Use SGparseString() instead of SGparseFile() because the latter is
buggy. It fails to clear an internal variable (SG_textIndex)
between invocations, so it can be called only once during a program
execution.
|
2003-10-31 11:22:56 +00:00 |
|
Eelco Dolstra
|
9f8f39aa3c
|
* Clean up the imploded parse tree. Quotes around strings are
removed, paths are absolutised relative to the path containing the
expression we just parsed, and integer literals are converted to
actual integers.
|
2003-10-30 16:18:40 +00:00 |
|
Eelco Dolstra
|
b95a3dc45b
|
* Basic grammar and parser for the Fix language. We use libsglr and
friends to do the parsing. The parse table is embedded in the Fix
executable using bin2c, which converts an arbitrary file into a C
character array.
|
2003-10-29 16:05:03 +00:00 |
|