|
| 1 | +package alpl |
| 2 | + |
| 3 | +import common.{Config, Interpreter} |
| 4 | +import parsers.{DepthRecurParser, EsoParser, RegexParser} |
| 5 | + |
| 6 | +import scala.annotation.tailrec |
| 7 | +import scala.collection.immutable |
| 8 | +import scala.util.Try |
| 9 | +import scala.util.control.TailCalls._ |
| 10 | + |
| 11 | +object ALPL extends Interpreter{ |
| 12 | + val name: String = "ALPL" |
| 13 | + |
| 14 | + val allParser: EsoParser[String, Vector[Expr]] = { |
| 15 | + val asnParser = RegexParser[Expr](raw"""=(.)"""){m => FuncExpr(Assign(m.group(1).head))} |
| 16 | + val prmParser = RegexParser[Expr](raw"""([^\[\]\.\`\=])"""){m => |
| 17 | + m.group(1) match{ |
| 18 | + case "?" => FuncExpr(Inp) |
| 19 | + case "0" => FuncExpr(Print(false)) |
| 20 | + case "1" => FuncExpr(Print(true)) |
| 21 | + case str => RefExpr(str.head)}} |
| 22 | + val lamParser = RegexParser[Expr](raw"""\[([^\.]*)\.([^\]]*)\]"""){m => |
| 23 | + val binds = m.group(1).toVector |
| 24 | + val ops = m.group(2).toVector.map{ |
| 25 | + case '`' => None |
| 26 | + case c => |
| 27 | + val expr = c match{ |
| 28 | + case '?' => FuncExpr(Inp) |
| 29 | + case '0' => FuncExpr(Print(false)) |
| 30 | + case '1' => FuncExpr(Print(true)) |
| 31 | + case _ => binds.indexOf(c) match{ |
| 32 | + case -1 => RefExpr(c) |
| 33 | + case i => BoundExpr(i)}} |
| 34 | + Some(expr)} |
| 35 | + FuncExpr(Lambda(ops, Vector(), binds.size))} |
| 36 | + |
| 37 | + def recur(str: String): Option[(String, Int, Int)] = if(str.startsWith("`")) Some((str.tail, 0, 1)) else None |
| 38 | + def collect(xs: Seq[Expr]): Expr = xs.reduceLeft(AppExpr) |
| 39 | + DepthRecurParser(asnParser.withErrors <+> prmParser.withErrors <+> lamParser.withErrors)(2)(recur)(collect) |
| 40 | + .withConditioning(_.replaceAll("""\s+""", "")) |
| 41 | + .withErrors.*} |
| 42 | + |
| 43 | + def apply(config: Config)(progRaw: String): Try[Seq[Char] => LazyList[Char]] = allParser(progRaw).toTry() map{ |
| 44 | + case prog +: es => |
| 45 | + inputs => { |
| 46 | + val width = config.num("charWidth") |
| 47 | + val initEnv = Env(immutable.HashMap(), binInp(inputs, width), 0, width - 1) |
| 48 | + val initRet: TailRec[Ret] = prog(PassCont(es), initEnv) |
| 49 | + LazyList.unfold(initRet)(nxt => nxt.result.resolve)}} |
| 50 | + |
| 51 | + def binInp(inp: Seq[Char], wid: Int = 8): Seq[Boolean] = { |
| 52 | + @tailrec |
| 53 | + def toBin(src: Int, ac: Vector[Boolean] = Vector()): Vector[Boolean] = { |
| 54 | + if(ac.sizeIs == wid) ac |
| 55 | + else toBin(src/2, (src%2 == 1) +: ac)} |
| 56 | + inp flatMap (c => toBin(c.toInt))} |
| 57 | + |
| 58 | + case class Env(funcs: immutable.HashMap[Char, Expr], inp: Seq[Boolean], oac: Int, onum: Int){ |
| 59 | + def apply(c: Char): Expr = funcs(c) |
| 60 | + def add(c: Char, exp: Expr): Env = Env(funcs + ((c, exp)), inp, oac, onum) |
| 61 | + def read: (Boolean, Env) = (inp.head, Env(funcs, inp.tail, oac, onum)) |
| 62 | + def write(bit: Int): (Option[Char], Env) = { |
| 63 | + val nac = (oac*2) + bit |
| 64 | + if(onum == 0) (Some(nac.toChar), Env(funcs, inp, 0, 7)) |
| 65 | + else (None, Env(funcs, inp, nac, onum - 1))}} |
| 66 | + |
| 67 | + trait Ret{ |
| 68 | + def resolve: Option[(Char, TailRec[Ret])]} |
| 69 | + |
| 70 | + trait Expr{ |
| 71 | + def apply(cc: Cont, env: Env): TailRec[Ret]} |
| 72 | + |
| 73 | + trait Cont{ |
| 74 | + def apply(f: Func, env: Env): TailRec[Ret]} |
| 75 | + |
| 76 | + trait Func{ |
| 77 | + def apply(f: Expr, cc: Cont, env: Env): TailRec[Ret]} |
| 78 | + |
| 79 | + //Returns |
| 80 | + object HaltRet extends Ret{ |
| 81 | + def resolve: Option[(Char, TailRec[Ret])] = None} |
| 82 | + |
| 83 | + case class PrintRet(c: Char, nxt: TailRec[Ret]) extends Ret { |
| 84 | + def resolve: Option[(Char, TailRec[Ret])] = Some((c, nxt))} |
| 85 | + |
| 86 | + //Expressions |
| 87 | + case class FuncExpr(f: Func) extends Expr{ |
| 88 | + def apply(cc: Cont, env: Env): TailRec[Ret] = tailcall(cc(f, env))} |
| 89 | + |
| 90 | + case class RefExpr(c: Char) extends Expr{ |
| 91 | + def apply(cc: Cont, env: Env): TailRec[Ret] = tailcall(env(c)(cc, env))} |
| 92 | + |
| 93 | + case class BoundExpr(n: Int) extends Expr{ |
| 94 | + def apply(cc: Cont, env: Env): TailRec[Ret] = done(HaltRet)} |
| 95 | + |
| 96 | + case class AppExpr(x: Expr, y: Expr) extends Expr{ |
| 97 | + def apply(cc: Cont, env: Env): TailRec[Ret] = tailcall(x(ExprCont(y, cc), env))} |
| 98 | + |
| 99 | + //Continuations |
| 100 | + object EndCont extends Cont{ |
| 101 | + def apply(f: Func, env: Env): TailRec[Ret] = done(HaltRet)} |
| 102 | + |
| 103 | + case class PassCont(exps: Seq[Expr]) extends Cont{ |
| 104 | + def apply(f: Func, env: Env): TailRec[Ret] = exps match{ |
| 105 | + case e +: es => tailcall(e(PassCont(es), env)) |
| 106 | + case _ => done(HaltRet)}} |
| 107 | + |
| 108 | + case class ExprCont(y: Expr, cc: Cont) extends Cont{ |
| 109 | + def apply(f: Func, env: Env): TailRec[Ret] = tailcall(f(y, cc, env))} |
| 110 | + |
| 111 | + //Functions |
| 112 | + case class Inp1(x: Expr) extends Func{ |
| 113 | + def apply(f: Expr, cc: Cont, env: Env): TailRec[Ret] = env.read match{ |
| 114 | + case (bit, nenv) => |
| 115 | + if(bit) tailcall(x(cc, nenv)) |
| 116 | + else tailcall(f(cc, nenv))}} |
| 117 | + object Inp extends Func{ |
| 118 | + def apply(f: Expr, cc: Cont, env: Env): TailRec[Ret] = tailcall(cc(Inp1(f), env))} |
| 119 | + |
| 120 | + case class Print(bit: Boolean) extends Func{ |
| 121 | + def apply(f: Expr, cc: Cont, env: Env): TailRec[Ret] = env.write(if(bit) 1 else 0) match{ |
| 122 | + case (res, nenv) => res match{ |
| 123 | + case Some(c) => done(PrintRet(c, tailcall(f(cc, nenv)))) |
| 124 | + case None => tailcall(f(cc, nenv))}}} |
| 125 | + |
| 126 | + case class Assign(c: Char) extends Func{ |
| 127 | + def apply(f: Expr, cc: Cont, env: Env): TailRec[Ret] = tailcall(f(cc, env.add(c, f)))} |
| 128 | + |
| 129 | + case class Lambda(ops: Vector[Option[Expr]], bound: Vector[Expr], rem: Int) extends Func{ |
| 130 | + def apply(f: Expr, cc: Cont, env: Env): TailRec[Ret] = { |
| 131 | + if(rem == 1) tailcall(collapse(bound :+ f)(cc, env)) |
| 132 | + else tailcall(cc(Lambda(ops, bound :+ f, rem - 1), env))} |
| 133 | + |
| 134 | + def collapse(binds: Vector[Expr]): Expr = { |
| 135 | + trait PC{ |
| 136 | + def apply(ex: Expr): PC} |
| 137 | + object EPC extends PC{ |
| 138 | + def apply(ex: Expr): PC = RPC(ex)} |
| 139 | + case class RPC(res: Expr) extends PC{ |
| 140 | + def apply(ex: Expr): PC = RPC(ex)} |
| 141 | + case class APC(cc: PC) extends PC{ |
| 142 | + def apply(ex: Expr): PC = APC1(ex, cc)} |
| 143 | + case class APC1(x: Expr, cc: PC) extends PC{ |
| 144 | + def apply(ex: Expr): PC = cc(AppExpr(x, ex))} |
| 145 | + |
| 146 | + @tailrec |
| 147 | + def cdo(src: Vector[Option[Expr]], cc: PC): Expr = src match{ |
| 148 | + case e +: es => e match{ |
| 149 | + case Some(BoundExpr(n)) => cdo(es, cc(binds(n))) |
| 150 | + case Some(ex) => cdo(es, cc(ex)) |
| 151 | + case None => cdo(es, APC(cc))} |
| 152 | + case _ => cc match{ |
| 153 | + case RPC(res) => res}} |
| 154 | + cdo(ops, EPC)}} |
| 155 | +} |
0 commit comments