def run
import bolt@1.27.0.0/src/syntax/tree.bend as Treeimport Base
import bolt@1.27.0.0/src/syntax/lex.bend as Lex
403# every token, in order
404def run(toks: List<&2, Lex.Tok>, st: B, glued: Bool) -> B:
405 match toks:
406 case Nil{}:
407 st
408 case Con{+tok, t}:
409 +g = is_name_tok(tok)
410 run(t, step(tok, st, glued), g)