fcl/Fcl.java

package com.vectron.fcl;

import com.vectron.fcl.exceptions.Aborted;
import com.vectron.fcl.exceptions.TypeMismatched;
import com.vectron.fcl.interop.JvmInterOp;
import com.vectron.fcl.types.ArithmeticOperand;
import com.vectron.fcl.types.Bool;
import com.vectron.fcl.types.LogicOperand;
import com.vectron.fcl.types.Nil;
import com.vectron.fcl.types.Num;
import com.vectron.fcl.types.Obj;
import com.vectron.fcl.types.Primitive;
import com.vectron.fcl.types.Str;
import com.vectron.fcl.types.Word;

import java.io.IOException;
import java.io.Reader;
import java.io.StringReader;
import java.util.Set;

public class Fcl {
    public static final boolean STRICT = true;
    private static final String EXIT = "exit";
    private final int SCRATCH_SIZE = 1024;
    private enum Mode { COMPILE, INTERPRET }
    private final Dictionary dict = new Dictionary();
    private final FclStack rstack = new FclStack();
    private final JvmInterOp interOp;
    private final FclStack stack;
    private final Transcript transcript;
    private Word lastWord;
    private Reader reader;
    private Mode mode = Mode.INTERPRET;
    private final Object[] heap;
    private int dp = SCRATCH_SIZE;
    private int ip = 0;

    class ColonDef implements Word {
        private final int address;
        private final String name;
        private boolean visible = true;

        public ColonDef(int address, String name) {
            this.address = address;
            this.name = name;
        }

        @Override
        public void enter() {
            rstack.push(new Num(ip));
            innerLoop(address);
            ip = rstack.pop().intValue();
        }

        @Override
        public String name() {
            return name;
        }

        @Override
        public void visible(boolean isVisible) {
            this.visible = isVisible;
        }

        @Override
        public boolean visible() {
            return visible;
        }

        @Override
        public String toString() {
            return "xt_" + name + " (" + address + ")";
        }

        @Override
        public long longValue() {
            return address;
        }

        @Override
        public int intValue() {
            return address;
        }

        @Override
        public double doubleValue() {
            throw new TypeMismatched(this, "double");
        }

        @Override
        public boolean boolValue() {
            throw new TypeMismatched(this, "bool");
        }

        @Override
        public Num asNum() {
            if (STRICT) throw new TypeMismatched(this, "num");
            return Num.NAN;
        }

        @Override
        public Str asStr() {
            return new Str(toString());
        }

        @Override
        public Object value() {
            return address;
        }

        @Override
        public int compareTo(Obj other) {
            return other instanceof ColonDef
                    ? name.compareTo(((ColonDef) other).name)
                    : -1;
        }
    }

    public class Var implements Word {
        private final int address;
        private final String name;
        private boolean visible = true;

        public Var(int address, String name) {
            this.address = address;
            this.name = name;
            heap[address] = new Num(0);
        }

        @Override
        public void visible(boolean isVisible) {
            this.visible = isVisible;
        }

        @Override
        public boolean visible() {
            return visible;
        }

        @Override
        public void enter() {
            stack.push(new Num(address));
        }

        @Override
        public String name() {
            return name;
        }

        @Override
        public String toString() {
            return "var_" + name + " (" + address + ")";
        }

        @Override
        public long longValue() {
            return address;
        }

        @Override
        public int intValue() {
            return address;
        }

        @Override
        public double doubleValue() {
            return address;
        }

        @Override
        public boolean boolValue() {
            throw new TypeMismatched(this, "bool");
        }

        @Override
        public Num asNum() {
            if (STRICT) throw new TypeMismatched(this, "num");
            return Num.NAN;
        }

        @Override
        public Str asStr() {
            return new Str(toString());
        }

        @Override
        public Object value() {
            return address;
        }

        @Override
        public int compareTo(Obj other) {
            return other instanceof Var
                    ? name.compareTo(((Var) other).name)
                    : -1;
        }
    }

    public class Val implements Word {
        private final String name;
        private final Obj value;
        private boolean visible = true;

        public Val(String name, Obj value) {
            this.name = name;
            this.value = value;
        }

        @Override
        public void visible(boolean isVisible) {
            this.visible = isVisible;
        }

        @Override
        public boolean visible() {
            return visible;
        }

        @Override
        public void enter() {
            stack.push(value);
        }

        @Override
        public String name() {
            return name;
        }

        @Override
        public String toString() {
            return "val_" + name + " (" + value + ")";
        }

        @Override
        public long longValue() {
            return value.longValue();
        }

        @Override
        public int intValue() {
            return value.intValue();
        }

        @Override
        public double doubleValue() {
            return value.doubleValue();
        }

        @Override
        public boolean boolValue() {
            return value.boolValue();
        }

        @Override
        public Num asNum() {
            if (STRICT) throw new TypeMismatched(this, "num");
            return Num.NAN;
        }

        @Override
        public Str asStr() {
            return new Str(toString());
        }

        @Override
        public Object value() {
            return value;
        }

        @Override
        public int compareTo(Obj other) {
            return other instanceof Val
                    ? name.compareTo(((Val) other).name)
                    : -1;
        }
    }


    public Fcl(FclStack stack, int heapSize, Transcript transcript) {
        this.stack = stack;
        this.heap = new Object[heapSize];
        this.interOp = new JvmInterOp(stack);
        this.transcript = transcript;
        initPrimitives();
    }

    private void initPrimitives() {
        addPrimitive("+", () -> stack.push((aOp(stack.pop())).add(stack.pop())));
        addPrimitive("-", () -> {
            Obj top = stack.pop();
            stack.push(aOp(stack.pop()).sub(top));
        });
        addPrimitive("*", () -> stack.push((aOp(stack.pop())).mul(stack.pop())));
        addPrimitive("/", () -> {
            Obj top = stack.pop();
            stack.push((aOp(stack.pop())).div(top));
        });
        addPrimitive("/mod", () -> {
            Num b = stack.pop().asNum();
            Num a = stack.pop().asNum();
            stack.push(a.mod(b));
            stack.push(a.intDiv(b));
        });
        addPrimitive("pow", () -> {
            Num exponent = stack.pop().asNum();
            Num base = stack.pop().asNum();
            stack.push(base.power(exponent));
        });
        addPrimitive("and", () -> stack.push(lOp(stack.pop()).and(stack.pop())));
        addPrimitive("or", () -> stack.push((lOp(stack.pop())).or(stack.pop())));
        addPrimitive("not", () -> stack.push((lOp(stack.pop())).not()));
        addPrimitive("drop", stack::pop);
        addPrimitive("dup", () -> stack.push(stack.peek()));
        addPrimitive("swap", () -> {
            Obj a = stack.pop();
            Obj b = stack.pop();
            stack.push(a);
            stack.push(b);
        });
        addPrimitive("rswap", () -> {
            Obj a = rstack.pop();
            Obj b = rstack.pop();
            rstack.push(a);
            rstack.push(b);
        });
        addPrimitive(EXIT, () -> {});
        addPrimitive("clean", stack::clean);
        addPrimitive("depth", () -> stack.push(new Num(stack.size())));
        addPrimitive("=", () -> stack.push(stack.pop().equals(stack.pop()) ? Bool.TRUE : Bool.FALSE));
        addPrimitive("<", () -> stack.push(stack.pop().asNum().greater(stack.pop().asNum())));
        addPrimitive("true", () -> stack.push(Bool.TRUE));
        addPrimitive("false", () -> stack.push(Bool.FALSE));
        addPrimitive("nil", () -> stack.push(Nil.INSTANCE));
        addPrimitive("here", () -> stack.push(new Num(dp)));
        addPrimitive("interpret", () -> mode = Mode.INTERPRET);
        addPrimitive("lit", () -> stack.push((Obj)heap[ip++]));
        addPrimitive(">r", () -> rstack.push(stack.pop()));
        addPrimitive("r>", () -> stack.push(rstack.pop()));
        addPrimitive("i", () -> stack.push(rstack.peek()));
        addPrimitive("j", () -> stack.push(rstack.at(1)));
        addPrimitive(",", () -> heap[dp++] = stack.pop());
        addPrimitive("!", () -> heap[stack.pop().intValue()] = stack.pop());
        addPrimitive("@", () -> stack.push((Obj) heap[stack.pop().intValue()]));
        addPrimitive("[']", () -> stack.push((Word)heap[ip++]));
        addPrimitive("`", () -> { Word word = dict.at(word()); stack.push(word == null ? Nil.INSTANCE : word); });
        addPrimitive("immediate", () -> dict.makeImmediate(lastWord));
        addPrimitive(".", () -> show(stack.pop()));
        addPrimitive("jvm-call-static", interOp::jvmCallStatic);
        addPrimitive("jvm-call-method", interOp::jvmCallMethod);
        addPrimitive("jvm-static-var", interOp::jvmStaticVar);
        addPrimitive("jvm-null", () -> stack.push(null));
        addPrimitive("asc*", this::sortAsc);
        addPrimitive("dsc*", this::sortDsc);
        addPrimitive("rev*", this::reverse);
        addPrimitive("key", () -> stack.push(new Num(key())));
        addPrimitive("word", () -> stack.push(new Str(word())));
        addPrimitive("override", () -> lastWord.visible(false));
        addPrimitive("reveal", () -> lastWord.visible(true));
        addPrimitive("delword", () -> dict.remove((String)stack.pop().value()));
        addPrimitive("jmp#f", () -> ip += stack.pop().boolValue() ? 1 : ((Num) heap[ip]).longValue());
        addPrimitive("jmp", () -> ip += ((Num) heap[ip]).longValue());
        addPrimitive("allot", () -> { int p = dp; dp += stack.pop().longValue(); stack.push(new Num(p)); });
        addPrimitive("freemem", () -> stack.push(new Num(heap.length - dp)));
        addPrimitive("var:", () -> { String name = word(); dict.add(new Var(dp, name)); dp++; });
        addPrimitive("val:", () -> { String name = word(); dict.add(new Val(name, stack.pop())); });
        addPrimitive("abort", () -> { throw new Aborted(stack.pop().asStr().value()); });
        addPrimitive("exec", () -> {
            rstack.push(new Num(ip));
            innerLoop(pop().intValue());
            ip = rstack.pop().intValue();
        });
        addPrimitive("create", () -> dict.add(new ColonDef(dp, (String)stack.pop().value())));
        addPrimitive("dasm", this::disassemble);
        addPrimitive(":", () -> {
            lastWord = new ColonDef(dp, word());
            dict.add(lastWord);
            mode = Mode.COMPILE;
        });
        addPrimitive(";", () -> {
            heap[dp++] = dict.at(EXIT);
            heap[dp++] = Nil.INSTANCE;
            mode = Mode.INTERPRET;
            lastWord.visible(true);
        });
    }

    private LogicOperand lOp(Obj obj) {
        try {
            return (LogicOperand) obj;
        } catch (ClassCastException e) {
            throw new TypeMismatched(obj + " cannot do logic operators on " + obj);
        }
    }

    private ArithmeticOperand aOp(Obj obj) {
        try {
            return (ArithmeticOperand) obj;
        } catch (ClassCastException e) {
            throw new TypeMismatched(obj + " cannot do arithmetic");
        }
    }

    private void show(Obj pop) {
        transcript.show(pop.asStr().value());
        transcript.cr();
    }

    private void disassemble() {
        String name = (String) stack.pop().value();
        Word word = dict.at(name);
        if (word instanceof ColonDef) {
            int address = ((ColonDef)word).address;
            while (true) {
                transcript.show(String.format("[%08X] %s", address, heap[address]));
                transcript.cr();
                if (heap[address] instanceof Word && ((Word)heap[address]).name().equals(EXIT)
                    && heap[address+1] == Nil.INSTANCE) {
                    break;
                }
                address++;
            }
        } else {
            System.err.println("Not colon def: " + word);
        }
    }

    private void sortDsc() {
        stack.sortDsc();
    }

    private void sortAsc() {
        stack.sortAsc();
    }

    private void reverse() {
        stack.reverse();
    }

    private void addPrimitive(String name, Runnable code) {
        dict.add(new Primitive(name, code));
    }

    public void eval(String source) {
        eval(new StringReader(source));
    }

    public void eval(Reader reader) {
        this.reader = reader;
        String token = word();
        while (!token.isEmpty()) {
            onTokenFound(token);
            token = word();
        }
    }

    /**
     * Compile a temporary word into the scratch area and call it.
     * This is useful for evaluating words without interpretation semantics.
     * Like: if else then, loops, quotations
     */
    public void compileTmpAndEval(String script) {
        int savedDp = dp;
        Mode savedMode = mode;
        try {
            dp = heap.length - SCRATCH_SIZE;
            mode = Mode.COMPILE;
            eval(script);
            eval(";");
            mode = Mode.INTERPRET;
            innerLoop(heap.length - SCRATCH_SIZE);
        } finally {
            dp = savedDp;
            mode = savedMode;
        }
    }

    private String word() {
        StringBuilder token = new StringBuilder();
        int key = key();
        while (key != -1) {
            char chr = (char) key;
            if (Character.isWhitespace(chr)) {
                if (token.length() > 0)
                    return token.toString();
                token.setLength(0);
            } else {
                token.append(chr);
            }
            key = key();
        }
        return token.toString();
    }

    private int key() {
        try {
            return reader.read();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }

    private void onTokenFound(String name) {
        Word word = dict.at(name);
        switch (mode) {
            case INTERPRET:
                if (word != null)
                    word.enter();
                else
                    stack.push(recognize(name));
                break;
            case COMPILE:
                if (word != null) {
                    if (dict.isImmediate(name))
                        word.enter();
                    else
                        heap[dp++] = word;
                } else {
                    heap[dp++] = dict.at("lit");
                    heap[dp++] = recognize(name);
                }
                break;
        }
    }

    private Obj recognize(String token) {
        Obj str = recognizeStr(token);
        if (str != null) return str;
        return Num.parse(token);
    }

    private Obj recognizeStr(String firstToken) {
        if (!firstToken.startsWith("'")) return null;
        StringBuilder str = new StringBuilder(firstToken.substring(1));
        if (firstToken.endsWith("'") && firstToken.length() > 1) {
            str.setLength(str.length() - 1);
        } else {
            str.append(" ");
            int k = key();
            while (k != -1 && (char) k != '\'') {
                str.append((char) k);
                k = key();
            }
        }
        return new Str(str.toString());
    }

    private void innerLoop(int address) {
        ip = address;
        Word word = (Word) heap[ip++];
        while (!EXIT.equals(word.name())) {
            word.enter();
            word = (Word) heap[ip++];
        }
    }

    public Word get(String name) {
        return dict.at(name);
    }

    public Obj pop() {
        return stack.pop();
    }

    public int stackSize() {
        return stack.size();
    }

    public int rStackSize() {
        return rstack.size();
    }

    public void switchStack(FclStack stack) {
        this.stack.switchStack(stack);
    }

    public void reset() {
        mode = Mode.INTERPRET;
        stack.clean();
        rstack.clean();
    }

    public Set<String> wordList() {
        return dict.wordList();
    }
}