st/lama_byterun
1
0
Fork 0
mirror of https://github.com/ProgramSnail/Lama.git synced 2025-12-06 06:48:48 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fixed yet another ugly bug in Ostap

Browse source
This commit is contained in:
Dmitry Boulytchev 2020-08-27 07:24:46 +03:00
parent f81a638659
commit 6f72275cfa
2 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/version.ml
View file

@ -1 +1 @@
let version = "Version 1.00, cc9f3d0ed, Tue Aug 25 23:21:39 2020 +0300" let version = "Version 1.00, f81a63865, Wed Aug 26 00:27:42 2020 +0300"

4
stdlib/Ostap.lama
View file

@ -43,12 +43,12 @@ public fun memo (f) {
if log then printf ("Applying memoized parser to %s\n", s.string) fi; if log then printf ("Applying memoized parser to %s\n", s.string) fi;
case findMap (deref (t), s) of case findMap (deref (t), s) of
None -> None ->
t ::= addMap (deref (t), s, [addSet (emptySet (compare), k), emptySet (compare)]); t ::= addMap (deref (t), s, [addSet (emptySet (compare), k), emptySet (fun (r1, r2) {case [r1, r2] of [Fail (_, _, _), Fail (_, _, _)] -> 0 | _ -> compare (r1, r2) esac })]);
f (fun (r) { f (fun (r) {
r := lookupMemo (restab, r); r := lookupMemo (restab, r);
if log then printf ("Running continuation with result %s\n", r.string) fi; if log then printf ("Running continuation with result %s\n", r.string) fi;
case findMap (deref (t), s) of case findMap (deref (t), s) of
Some ([ks, rs]) -> Some ([ks, rs]) ->
if memSet (rs, r) if memSet (rs, r)
then skip then skip
else else