7 size_RS = 1024 # Return stack size
8 size_PS = 1024 # Parameter stack size
9 size_TIB = 1096 # Terminal input buffer size
11 # The mem array constitutes the memory of the VM. It has the following geography:
13 # mem = +-----------------------+
14 # | Built-in Variables |
15 # +-----------------------+
17 # +-----------------------+
19 # +-----------------------+
20 # | Terminal Input Buffer |
21 # +-----------------------+
23 # +-----------------------+
25 # Note that all words (user-defined, primitive, variables, etc) are included in
28 # Simple linear addressing is used with one exception: references to primitive code
29 # blocks, which are represented as anonymous functions, appear as negative indicies
30 # into the primitives array which contains these functions.
32 mem = Array{Int64,1}(size_mem)
33 primitives = Array{Function,1}()
34 primNames = Array{ASCIIString,1}()
39 RSP0 = nextVarAddr; nextVarAddr += 1
40 PSP0 = nextVarAddr; nextVarAddr += 1
41 HERE = nextVarAddr; nextVarAddr += 1
42 LATEST = nextVarAddr; nextVarAddr += 1
44 mem[RSP0] = nextVarAddr # bottom of RS
45 mem[PSP0] = mem[RSP0] + size_RS # bottom of PS
46 TIB = mem[PSP0] + size_PS # address of terminal input buffer
47 mem[HERE] = TIB + size_TIB # location of bottom of dictionary
48 mem[LATEST] = 0 # no previous definition
50 DICT = mem[HERE] # Save bottom of dictionary as constant
54 RSP::Int64 # Return stack pointer
55 PSP::Int64 # Parameter/data stack pointer
56 IP::Int64 # Instruction pointer
57 W::Int64 # Working register
59 reg = Reg(mem[RSP0], mem[PSP0], 0, 0)
61 # Stack manipulation functions
63 type ParamStackUnderflow <: Exception end
64 type ReturnStackUnderflow <: Exception end
66 Base.showerror(io::IO, ex::ParamStackUnderflow) = print(io, "Parameter stack underflow.")
67 Base.showerror(io::IO, ex::ReturnStackUnderflow) = print(io, "Return stack underflow.")
69 getRSDepth() = reg.RSP - mem[RSP0]
70 getPSDepth() = reg.PSP - mem[PSP0]
72 function ensurePSDepth(depth::Int64)
74 throw(ParamStackUnderflow())
78 function ensureRSDepth(depth::Int64)
80 throw(ReturnStackUnderflow())
84 function pushRS(val::Int64)
96 function pushPS(val::Int64)
97 mem[reg.PSP += 1] = val
108 # Handy functions for adding/retrieving strings to/from memory.
110 getString(addr::Int64, len::Int64) = ASCIIString([Char(c) for c in mem[addr:(addr+len-1)]])
111 function putString(str::ASCIIString, addr::Int64)
112 mem[addr:(addr+length(str)-1)] = [Int64(c) for c in str]
115 # Primitive creation and calling functions
117 function defPrim(f::Function; name="nameless")
119 push!(primNames, replace(replace(name, "\004", "EOF"), "\n", "\\n"))
121 return -length(primitives)
124 callPrim(addr::Int64) = primitives[-addr]()
126 # Word creation functions
128 function createHeader(name::AbstractString, flags::Int64)
129 mem[mem[HERE]] = mem[LATEST]
130 mem[LATEST] = mem[HERE]
133 mem[mem[HERE]] = length(name) | flags; mem[HERE] += 1
134 putString(name, mem[HERE]); mem[HERE] += length(name)
137 function defPrimWord(name::AbstractString, f::Function; flags::Int64=0)
138 createHeader(name, flags)
140 codeWordAddr = mem[HERE]
141 mem[codeWordAddr] = defPrim(f, name=name)
147 function defWord(name::AbstractString, wordAddrs::Array{Int64,1}; flags::Int64=0)
148 createHeader(name, flags)
151 mem[mem[HERE]] = DOCOL
154 for wordAddr in wordAddrs
155 mem[mem[HERE]] = wordAddr
162 # Variable creation functions
164 function defExistingVar(name::AbstractString, varAddr::Int64; flags::Int64=0)
166 defPrimWord(name, eval(:(() -> begin
172 function defNewVar(name::AbstractString, initial::Int64; flags::Int64=0)
173 createHeader(name, flags)
175 codeWordAddr = mem[HERE]
176 varAddr = mem[HERE] + 1
178 mem[mem[HERE]] = DOVAR; mem[HERE] += 1
179 mem[mem[HERE]] = initial; mem[HERE] += 1
181 return varAddr, codeWordAddr
184 function defConst(name::AbstractString, val::Int64; flags::Int64=0)
185 createHeader(name, flags)
187 mem[mem[HERE]] = DOCON; mem[HERE] += 1
188 mem[mem[HERE]] = val; mem[HERE] += 1
193 # Threading Primitives (inner interpreter)
195 NEXT = defPrim(() -> begin
201 DOCOL = defPrim(() -> begin
207 DOVAR = defPrim(() -> begin
212 DOCON = defPrim(() -> begin
213 pushPS(mem[reg.W + 1])
217 EXIT = defPrimWord("EXIT", () -> begin
222 # Basic forth primitives
224 DROP = defPrimWord("DROP", () -> begin
229 SWAP = defPrimWord("SWAP", () -> begin
237 DUP = defPrimWord("DUP", () -> begin
243 OVER = defPrimWord("OVER", () -> begin
245 pushPS(mem[reg.PSP-1])
249 ROT = defPrimWord("ROT", () -> begin
259 NROT = defPrimWord("-ROT", () -> begin
270 TWODROP = defPrimWord("2DROP", () -> begin
276 TWODUP = defPrimWord("2DUP", () -> begin
285 TWOSWAP = defPrimWord("2SWAP", () -> begin
297 TWOOVER = defPrimWord("2OVER", () -> begin
306 QDUP = defPrimWord("?DUP", () -> begin
315 INCR = defPrimWord("1+", () -> begin
321 DECR = defPrimWord("1-", () -> begin
327 INCR2 = defPrimWord("2+", () -> begin
333 DECR2 = defPrimWord("2-", () -> begin
339 ADD = defPrimWord("+", () -> begin
346 SUB = defPrimWord("-", () -> begin
353 MUL = defPrimWord("*", () -> begin
360 DIVMOD = defPrimWord("/MOD", () -> begin
369 TWOMUL = defPrimWord("2*", () -> begin
374 TWODIV = defPrimWord("2/", () -> begin
379 EQU = defPrimWord("=", () -> begin
382 pushPS(a==b ? -1 : 0)
386 NEQU = defPrimWord("<>", () -> begin
389 pushPS(a!=b ? -1 : 0)
393 LT = defPrimWord("<", () -> begin
400 GT = defPrimWord(">", () -> begin
407 LE = defPrimWord("<=", () -> begin
410 pushPS(a<=b ? -1 : 0)
414 GE = defPrimWord(">=", () -> begin
417 pushPS(a>=b ? -1 : 0)
421 ZEQU = defPrimWord("0=", () -> begin
422 pushPS(popPS() == 0 ? -1 : 0)
426 ZNEQU = defPrimWord("0<>", () -> begin
427 pushPS(popPS() != 0 ? -1 : 0)
431 ZLT = defPrimWord("0<", () -> begin
432 pushPS(popPS() < 0 ? -1 : 0)
436 ZGT = defPrimWord("0>", () -> begin
437 pushPS(popPS() > 0 ? -1 : 0)
441 ZLE = defPrimWord("0<=", () -> begin
442 pushPS(popPS() <= 0 ? -1 : 0)
446 ZGE = defPrimWord("0>=", () -> begin
447 pushPS(popPS() >= 0 ? -1 : 0)
451 AND = defPrimWord("AND", () -> begin
458 OR = defPrimWord("OR", () -> begin
465 XOR = defPrimWord("XOR", () -> begin
472 INVERT = defPrimWord("INVERT", () -> begin
479 LIT = defPrimWord("LIT", () -> begin
487 STORE = defPrimWord("!", () -> begin
494 FETCH = defPrimWord("@", () -> begin
500 ADDSTORE = defPrimWord("+!", () -> begin
507 SUBSTORE = defPrimWord("-!", () -> begin
517 HERE_CFA = defExistingVar("HERE", HERE)
518 LATEST_CFA = defExistingVar("LATEST", LATEST)
519 PSP0_CFA = defExistingVar("PSP0", PSP0)
520 RSP0_CFA = defExistingVar("RSP0", RSP0)
521 STATE, STATE_CFA = defNewVar("STATE", 0)
522 BASE, BASE_CFA = defNewVar("BASE", 10)
526 defConst("DOCOL", DOCOL)
527 defConst("DOCON", DOCON)
528 defConst("DOVAR", DOVAR)
530 defConst("DICT", DICT)
532 F_IMMED = defConst("F_IMMED", 128)
533 F_HIDDEN = defConst("F_HIDDEN", 256)
534 F_LENMASK = defConst("F_LENMASK", 127)
538 TOR = defPrimWord(">R", () -> begin
543 FROMR = defPrimWord("R>", () -> begin
548 RFETCH = defPrimWord("R@", () -> begin
553 RSPFETCH = defPrimWord("RSP@", () -> begin
558 RSPSTORE = defPrimWord("RSP!", () -> begin
563 RDROP = defPrimWord("RDROP", () -> begin
570 PSPFETCH = defPrimWord("PSP@", () -> begin
575 PSPSTORE = defPrimWord("PSP!", () -> begin
582 WFETCH = defPrimWord("W@", () -> begin
587 WSTORE = defPrimWord("W!", () -> begin
594 sources = Array{Any,1}()
595 currentSource() = sources[length(sources)]
598 NUMTIB, NUMTIB_CFA = defNewVar("#TIB", 0)
599 TOIN, TOIN_CFA = defNewVar(">IN", 0)
600 EOF = defConst("EOF", 4)
602 KEY = defPrimWord("KEY", () -> begin
603 if mem[TOIN] >= mem[NUMTIB]
606 if !eof(currentSource())
607 line = readline(currentSource())
608 mem[NUMTIB] = length(line)
616 pushPS(mem[TIB + mem[TOIN]])
622 EMIT = defPrimWord("EMIT", () -> begin
627 WORD = defPrimWord("WORD", () -> begin
644 if c == '\n' || c == eof_char
650 if c == ' ' || c == '\t'
660 if c == '\n' || c == eof_char
661 # Treat newline as a special word
663 mem[wordAddr + offset] = Int64(c)
670 mem[wordAddr + offset] = Int64(c)
676 if c == ' ' || c == '\t' || c == '\n' || c == eof_char
691 NUMBER = defPrimWord("NUMBER", () -> begin
696 s = getString(wordAddr, wordLen)
699 pushPS(parse(Int64, s, mem[BASE]))
702 pushPS(1) # Error indication
708 # Dictionary searches
710 FIND = defPrimWord("FIND", () -> begin
714 word = lowercase(getString(wordAddr, wordLen))
719 while (latest = mem[latest]) > 0
720 lenAndFlags = mem[latest+1]
721 len = lenAndFlags & F_LENMASK
722 hidden = (lenAndFlags & F_HIDDEN) == F_HIDDEN
724 if hidden || len != wordLen
729 thisWord = lowercase(getString(thisAddr, len))
731 if lowercase(thisWord) == lowercase(word)
741 TOCFA = defPrimWord(">CFA", () -> begin
744 lenAndFlags = mem[addr+1]
745 len = lenAndFlags & F_LENMASK
747 pushPS(addr + 2 + len)
752 TODFA = defWord(">DFA", [TOCFA, INCR, EXIT])
756 BRANCH = defPrimWord("BRANCH", () -> begin
757 reg.IP += mem[reg.IP]
761 ZBRANCH = defPrimWord("0BRANCH", () -> begin
763 reg.IP += mem[reg.IP]
773 HEADER = defPrimWord("HEADER", () -> begin
777 word = getString(wordAddr, wordLen)
779 createHeader(word, 0)
784 COMMA = defPrimWord(",", () -> begin
785 mem[mem[HERE]] = popPS()
791 LBRAC = defPrimWord("[", () -> begin
796 RBRAC = defPrimWord("]", () -> begin
801 HIDDEN = defPrimWord("HIDDEN", () -> begin
803 mem[addr] = mem[addr] $ F_HIDDEN
807 HIDE = defWord("HIDE",
817 LATEST_CFA, FETCH, HIDDEN,
821 SEMICOLON = defWord(";",
823 LATEST_CFA, FETCH, HIDDEN,
825 EXIT], flags=F_IMMED)
827 IMMEDIATE = defPrimWord("IMMEDIATE", () -> begin
828 lenAndFlagsAddr = mem[LATEST] + 1
829 mem[lenAndFlagsAddr] = mem[lenAndFlagsAddr] $ F_IMMED
834 [WORD, FIND, TOCFA, EXIT])
836 BTICK = defWord("[']",
837 [FROMR, DUP, INCR, TOR, FETCH, EXIT])
842 LITSTRING = defPrimWord("LITSTRING", () -> begin
852 TELL = defPrimWord("TELL", () -> begin
855 str = getString(addr, len)
862 EXECUTE = defPrimWord("EXECUTE", () -> begin
867 type ParseError <: Exception
868 wordName::ASCIIString
870 Base.showerror(io::IO, ex::ParseError) = print(io, "Parse error at word: '$(ex.wordName)'.")
872 DEBUG, DEBUG_CFA = defNewVar("DEBUG", 0)
874 INTERPRET = defPrimWord("INTERPRET", () -> begin
878 wordName = getString(mem[reg.PSP-1], mem[reg.PSP])
880 println("... ", replace(replace(wordName, "\004", "EOF"), "\n", "\\n"), " ...")
883 callPrim(mem[TWODUP])
886 wordAddr = mem[reg.PSP]
891 isImmediate = (mem[wordAddr+1] & F_IMMED) != 0
894 callPrim(mem[NROT]) # get rid of extra copy of word string details
898 if mem[STATE] == 0 || isImmediate
900 return callPrim(mem[EXECUTE])
902 # Append CFA to dictionary
906 # Not in dictionary, assume number
910 callPrim(mem[NUMBER])
913 throw(ParseError(wordName))
917 # Number already on stack!
919 # Append literal to dictionary
929 QUIT = defWord("QUIT",
934 BYE = defPrimWord("BYE", () -> begin
938 PROMPT = defPrimWord("PROMPT", () -> begin
942 NL = defPrimWord("\n", () -> begin
943 if mem[STATE] == 0 && currentSource() == STDIN
944 callPrim(mem[PROMPT])
949 INCLUDE = defPrimWord("INCLUDE", () -> begin
953 word = getString(wordAddr, wordLen)
955 push!(sources, open(word, "r"))
963 EOF_WORD = defPrimWord("\x04", () -> begin
964 if currentSource() != STDIN
965 close(currentSource())
971 if currentSource() == STDIN
972 callPrim(mem[PROMPT])
983 CHAR = defPrimWord("CHAR", () -> begin
987 word = getString(wordAddr, wordLen)
988 pushPS(Int64(word[1]))
994 initFileName = nothing
996 initFileName = "lib.4th"
997 elseif isfile(Pkg.dir("forth/src/lib.4th"))
998 initFileName = Pkg.dir("forth/src/lib.4th")
1003 function run(;initialize=true)
1004 # Begin with STDIN as source
1005 push!(sources, STDIN)
1007 global initialized, initFileName
1008 if !initialized && initialize
1009 if initFileName != nothing
1010 print("Including definitions from $initFileName...")
1011 push!(sources, open(initFileName, "r"))
1014 println("No library file found. Only primitive words available.")
1018 # Start with IP pointing to first instruction of outer interpreter
1021 # Primitive processing loop.
1022 # Everyting else is simply a consequence of this loop!
1027 println("Evaluating prim ", jmp," ", primNames[-jmp])
1033 showerror(STDOUT, ex)
1036 while !isempty(sources) && currentSource() != STDIN
1037 close(pop!(sources))
1052 function dump(startAddr::Int64; count::Int64 = 100, cellsPerLine::Int64 = 10)
1053 chars = Array{Char,1}(cellsPerLine)
1055 lineStartAddr = cellsPerLine*div((startAddr-1),cellsPerLine) + 1
1056 endAddr = startAddr + count - 1
1058 q, r = divrem((endAddr-lineStartAddr+1), cellsPerLine)
1059 numLines = q + (r > 0 ? 1 : 0)
1065 for c in 1:cellsPerLine
1066 if i >= startAddr && i <= endAddr
1068 if mem[i]>=32 && mem[i]<128
1069 chars[c] = Char(mem[i])
1081 println("\t", ASCIIString(chars))
1086 count = reg.PSP - mem[PSP0]
1090 for i in (mem[PSP0]+1):reg.PSP
1095 println("Parameter stack empty")
1100 count = reg.RSP - mem[RSP0]
1104 for i in (mem[RSP0]+1):reg.RSP
1109 println("Return stack empty")
1113 DUMP = defPrimWord("DUMP", () -> begin
1117 dump(addr, count=count)