#
6f275541 |
|
27-Aug-2017 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Fix pretty-printing: list-syntax for SX_CONS should take precedence Just as with list-syntax for CONS (see 70e6ee11), this now needs to be done by having the list-rule come after the rule for the binary operator to pick up a later timestamp, and thus be preferred.
|
#
a345ee63 |
|
07-Aug-2017 |
Ramana Kumar <ramana@member.fsf.org> |
Avoid ARB in simpleSexp grammar and parser
|
#
c59c4caf |
|
13-Feb-2017 |
H.Feree <h.feree@kent.ac.uk> |
Location in parser done (up to a cheat)
|
#
1478d63c |
|
04-Dec-2016 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Change monadsyntax to NOT change global grammar on load Instead, users must explicitly call {temp_,}add_monadsyntax to turn do .. od and the <- syntax on, along with the pretty-printing and augmented parsing.
|
#
92f6129d |
|
15-Apr-2016 |
Ramana Kumar <ramana@member.fsf.org> |
Prove string case of peg_eval_print_sexp Needed to augment valid_sexp to restrict strings to printable characters. Also did some a bit of work on the final (hardest) case of the lemma.
|
#
a5acf22e |
|
24-Sep-2015 |
Ramana Kumar <ramana@member.fsf.org> |
I think a symbol should not start with a . or a " It would probably be possible to allow symbols starting with ".", but is it worth the effort? Also, I noticed a discrepancy with my understanding of sexps: (this is a dotted . list) is not allowed, but I think it should be (representing (this . (is . (a . (dotted . list)))))
|
#
fa568621 |
|
24-Sep-2015 |
Ramana Kumar <ramana@member.fsf.org> |
define valid_sexp the only restriction is on symbols (hopefully that's enough for parsing back what's printed)
|
#
e8b1de20 |
|
24-Sep-2015 |
Ramana Kumar <ramana@member.fsf.org> |
fix sexpPEG so it is wfG (and still passes tests) rather ugly peg expression for sexpnum, but seems hard to avoid
|
#
016407b9 |
|
23-Sep-2015 |
Ramana Kumar <ramana@member.fsf.org> |
sxMEM_sizelt (moved from CakeML)
|
#
05199544 |
|
20-Sep-2015 |
Konrad Slind <konrad.slind@gmail.com> |
playground for formal language theory developments.
|