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

More stdlib; memoized CPS parser combinators workout

Browse source
This commit is contained in:
Dmitry Boulytchev 2020-01-20 03:38:43 +03:00
parent b05ad7f6b1
commit 1027d988fc
10 changed files with 253 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

9
stdlib/Collection.expr
View file

@ -5,6 +5,7 @@
-- data structures.
import List;
import Ref;
fun insertColl (m, pk, v, sort) {
local k = case sort of Hash -> hash (pk) | _ -> pk esac;
@ -259,24 +260,24 @@ public fun foldSet (f, acc, s) {
-- Hash consing
public fun emptyMemo () {
[{}]
ref ({})
}
public fun lookupMemo (m, v) {
case v of
#unboxed -> v
| _ ->
case findMap (m[0], v) of
case findMap (deref (m), v) of
Some (w) -> w
| None ->
case v of
#string -> m[0] := addMap (m[0], v, v); v
#string -> m ::= addMap (deref (m), v, v); v
| _ ->
local vc = clone (v), i = case vc of #fun -> 1 | _ -> 0 esac;
for skip, i < v.length, i := i + 1 do
vc [i] := lookupMemo (m, vc [i])
od;
m[0] := addMap (m[0], vc, vc);
m ::= addMap (deref (m), vc, vc);
vc
esac
esac