|
|
@@ -96,117 +96,118 @@ func interpret(scanner *scanProvider, envs []environ) (val value, returned bool)
|
|
|
}
|
|
|
paramCnt, ok := reserved[stack[i].word]
|
|
|
if ok {
|
|
|
- if paramCnt > len(stack)-1-i {
|
|
|
- break
|
|
|
+ if paramCnt == len(stack)-1-i {
|
|
|
+ for j := i + 1; j < len(stack); j++ {
|
|
|
+ stack[j] = toValue(stack[j], envs[0])
|
|
|
+ }
|
|
|
+ switch stack[i].word {
|
|
|
+ case "make":
|
|
|
+ stack[i] = opMake(stack[i+1], stack[i+2], envs)
|
|
|
+ case "thing":
|
|
|
+ stack[i] = opThing(stack[i+1], envs)
|
|
|
+ case "print":
|
|
|
+ stack[i] = opPrint(stack[i+1])
|
|
|
+ case "read":
|
|
|
+ stack[i] = opRead(scanner)
|
|
|
+ case "add":
|
|
|
+ stack[i] = opAdd(stack[i+1], stack[i+2])
|
|
|
+ case "sub":
|
|
|
+ stack[i] = opSub(stack[i+1], stack[i+2])
|
|
|
+ case "mul":
|
|
|
+ stack[i] = opMul(stack[i+1], stack[i+2])
|
|
|
+ case "div":
|
|
|
+ stack[i] = opDiv(stack[i+1], stack[i+2])
|
|
|
+ case "mod":
|
|
|
+ stack[i] = opMod(stack[i+1], stack[i+2])
|
|
|
+ case "erase":
|
|
|
+ stack[i] = opErase(stack[i+1], envs)
|
|
|
+ case "isname":
|
|
|
+ stack[i] = opIsName(stack[i+1], envs)
|
|
|
+ case "run":
|
|
|
+ stack[i], returned = opRun(stack[i+1], envs)
|
|
|
+ case "eq":
|
|
|
+ stack[i] = opEq(stack[i+1], stack[i+2])
|
|
|
+ case "gt":
|
|
|
+ stack[i] = opGt(stack[i+1], stack[i+2])
|
|
|
+ case "lt":
|
|
|
+ stack[i] = opLt(stack[i+1], stack[i+2])
|
|
|
+ case "and":
|
|
|
+ stack[i] = opAnd(stack[i+1], stack[i+2])
|
|
|
+ case "or":
|
|
|
+ stack[i] = opOr(stack[i+1], stack[i+2])
|
|
|
+ case "not":
|
|
|
+ stack[i] = opNot(stack[i+1])
|
|
|
+ case "if":
|
|
|
+ stack[i], returned = opIf(stack[i+1], stack[i+2], stack[i+3], envs)
|
|
|
+ case "isnumber":
|
|
|
+ stack[i] = opIsNumber(stack[i+1])
|
|
|
+ case "isword":
|
|
|
+ stack[i] = opIsWord(stack[i+1])
|
|
|
+ case "islist":
|
|
|
+ stack[i] = opIsList(stack[i+1])
|
|
|
+ case "isbool":
|
|
|
+ stack[i] = opIsBool(stack[i+1])
|
|
|
+ case "isempty":
|
|
|
+ stack[i] = opIsEmpty(stack[i+1])
|
|
|
+ case "return":
|
|
|
+ stack[i], returned = stack[i+1], true
|
|
|
+ case "export":
|
|
|
+ stack[i] = opExport(stack[i+1], envs)
|
|
|
+ case "readlist":
|
|
|
+ stack[i] = opReadList(scanner)
|
|
|
+ case "word":
|
|
|
+ stack[i] = opWord(stack[i+1], stack[i+2])
|
|
|
+ case "sentence":
|
|
|
+ stack[i] = opSentence(stack[i+1], stack[i+2])
|
|
|
+ case "list":
|
|
|
+ stack[i] = opList(stack[i+1], stack[i+2])
|
|
|
+ case "join":
|
|
|
+ stack[i] = opJoin(stack[i+1], stack[i+2])
|
|
|
+ case "first":
|
|
|
+ stack[i] = opFirst(stack[i+1])
|
|
|
+ case "last":
|
|
|
+ stack[i] = opLast(stack[i+1])
|
|
|
+ case "butfirst":
|
|
|
+ stack[i] = opButFirst(stack[i+1])
|
|
|
+ case "butlast":
|
|
|
+ stack[i] = opButLast(stack[i+1])
|
|
|
+ case "random":
|
|
|
+ stack[i] = opRandom(stack[i+1])
|
|
|
+ case "int":
|
|
|
+ stack[i] = opInt(stack[i+1])
|
|
|
+ case "sqrt":
|
|
|
+ stack[i] = opSqrt(stack[i+1])
|
|
|
+ case "save":
|
|
|
+ stack[i] = opSave(stack[i+1], envs[0])
|
|
|
+ case "load":
|
|
|
+ stack[i] = opLoad(stack[i+1], envs[0])
|
|
|
+ case "erall":
|
|
|
+ stack[i] = opErAll(envs[0])
|
|
|
+ case "poall":
|
|
|
+ stack[i] = opPoAll(envs[0])
|
|
|
+ }
|
|
|
+ stack = stack[:i+1]
|
|
|
+ updated = true
|
|
|
}
|
|
|
- for j := i + 1; j < len(stack); j++ {
|
|
|
- stack[j] = toValue(stack[j], envs[0])
|
|
|
- }
|
|
|
- switch stack[i].word {
|
|
|
- case "make":
|
|
|
- stack[i] = opMake(stack[i+1], stack[i+2], envs)
|
|
|
- case "thing":
|
|
|
- stack[i] = opThing(stack[i+1], envs)
|
|
|
- case "print":
|
|
|
- stack[i] = opPrint(stack[i+1])
|
|
|
- case "read":
|
|
|
- stack[i] = opRead(scanner)
|
|
|
- case "add":
|
|
|
- stack[i] = opAdd(stack[i+1], stack[i+2])
|
|
|
- case "sub":
|
|
|
- stack[i] = opSub(stack[i+1], stack[i+2])
|
|
|
- case "mul":
|
|
|
- stack[i] = opMul(stack[i+1], stack[i+2])
|
|
|
- case "div":
|
|
|
- stack[i] = opDiv(stack[i+1], stack[i+2])
|
|
|
- case "mod":
|
|
|
- stack[i] = opMod(stack[i+1], stack[i+2])
|
|
|
- case "erase":
|
|
|
- stack[i] = opErase(stack[i+1], envs)
|
|
|
- case "isname":
|
|
|
- stack[i] = opIsName(stack[i+1])
|
|
|
- case "run":
|
|
|
- stack[i], returned = opRun(stack[i+1], envs)
|
|
|
- case "eq":
|
|
|
- stack[i] = opEq(stack[i+1], stack[i+2])
|
|
|
- case "gt":
|
|
|
- stack[i] = opGt(stack[i+1], stack[i+2])
|
|
|
- case "lt":
|
|
|
- stack[i] = opLt(stack[i+1], stack[i+2])
|
|
|
- case "and":
|
|
|
- stack[i] = opAnd(stack[i+1], stack[i+2])
|
|
|
- case "or":
|
|
|
- stack[i] = opOr(stack[i+1], stack[i+2])
|
|
|
- case "not":
|
|
|
- stack[i] = opNot(stack[i+1])
|
|
|
- case "if":
|
|
|
- stack[i], returned = opIf(stack[i+1], stack[i+2], stack[i+3], envs)
|
|
|
- case "isnumber":
|
|
|
- stack[i] = opIsNumber(stack[i+1])
|
|
|
- case "isword":
|
|
|
- stack[i] = opIsWord(stack[i+1])
|
|
|
- case "islist":
|
|
|
- stack[i] = opIsList(stack[i+1])
|
|
|
- case "isbool":
|
|
|
- stack[i] = opIsBool(stack[i+1])
|
|
|
- case "isempty":
|
|
|
- stack[i] = opIsEmpty(stack[i+1])
|
|
|
- case "return":
|
|
|
- stack[i], returned = stack[i+1], true
|
|
|
- case "export":
|
|
|
- stack[i] = opExport(stack[i+1], envs)
|
|
|
- case "readlist":
|
|
|
- stack[i] = opReadList(scanner)
|
|
|
- case "word":
|
|
|
- stack[i] = opWord(stack[i+1], stack[i+2])
|
|
|
- case "sentence":
|
|
|
- stack[i] = opSentence(stack[i+1], stack[i+2])
|
|
|
- case "list":
|
|
|
- stack[i] = opList(stack[i+1], stack[i+2])
|
|
|
- case "join":
|
|
|
- stack[i] = opJoin(stack[i+1], stack[i+2])
|
|
|
- case "first":
|
|
|
- stack[i] = opFirst(stack[i+1])
|
|
|
- case "last":
|
|
|
- stack[i] = opLast(stack[i+1])
|
|
|
- case "butfirst":
|
|
|
- stack[i] = opButFirst(stack[i+1])
|
|
|
- case "butlast":
|
|
|
- stack[i] = opButLast(stack[i+1])
|
|
|
- case "random":
|
|
|
- stack[i] = opRandom(stack[i+1])
|
|
|
- case "int":
|
|
|
- stack[i] = opInt(stack[i+1])
|
|
|
- case "sqrt":
|
|
|
- stack[i] = opSqrt(stack[i+1])
|
|
|
- case "save":
|
|
|
- stack[i] = opSave(stack[i+1], envs[0])
|
|
|
- case "load":
|
|
|
- stack[i] = opLoad(stack[i+1], envs[0])
|
|
|
- case "erall":
|
|
|
- stack[i] = opErAll(envs[0])
|
|
|
- case "poall":
|
|
|
- stack[i] = opPoAll(envs[0])
|
|
|
- }
|
|
|
- stack = stack[:i+1]
|
|
|
- updated = true
|
|
|
+ break
|
|
|
}
|
|
|
val, _ := getValue(`"`+stack[i].word, envs)
|
|
|
if val.param != nil {
|
|
|
- if len(val.param) > len(stack)-1-i {
|
|
|
- break
|
|
|
+ if len(val.param) == len(stack)-1-i {
|
|
|
+ for j := i + 1; j < len(stack); j++ {
|
|
|
+ stack[j] = toValue(stack[j], envs[0])
|
|
|
+ }
|
|
|
+ local := environ{stack[i].word: val}
|
|
|
+ for j, name := range val.param {
|
|
|
+ local[name] = stack[i+1+j]
|
|
|
+ }
|
|
|
+ stack[i], _ = opRun(value{tp: typeList, list: val.body}, []environ{local, val.env, envs[2]})
|
|
|
+ stack = stack[:i+1]
|
|
|
+ updated = true
|
|
|
}
|
|
|
- for j := i + 1; j < len(stack); j++ {
|
|
|
- stack[j] = toValue(stack[j], envs[0])
|
|
|
- }
|
|
|
- local := environ{stack[i].word: val}
|
|
|
- for j, name := range val.param {
|
|
|
- local[name] = stack[i+1+j]
|
|
|
- }
|
|
|
- stack[i], _ = opRun(value{tp: typeList, list: val.body}, []environ{local, val.env, envs[2]})
|
|
|
- stack = stack[:i+1]
|
|
|
- updated = true
|
|
|
+ break
|
|
|
}
|
|
|
+ panic(fmt.Errorf("func: %s (%s)", errFunctionExpected, stack[i].word))
|
|
|
}
|
|
|
if !updated {
|
|
|
break
|