– Just another PL/0 interpreter.
- Written in modern C++ and object-oriented paradigm.
- Be able to generate versatile ast
- Be able to generate picture of the ast
PL/0 uses cmake as its building toolchains, which is available in all platforms. To build PL/0, first and formost, you should clone this project to your computer. Then you can follow the instructions below:
For CLion Users
If you're using CLion as your C++ IDE, you can load this project directly into CLion by clicking "Import Project from Sources" on the startup screen of CLion.For macOS Users
If you're using CLion as your C++ IDE, you can load this project directly into CLion by clicking "Import Project from Sources" on the startup screen of CLion.For Linux (or Cygwin) Users
If you're using Linux (or Cygwin). The best way is using GNU make. Just `cd` into this project and execute following command.mkdir -p cmake-build
cd cmake-build
cmake .. -G "Unix Makefiles"For Windows Users
Make sure that the Microsoft C++ compiler is installed with your Visual Studio. Then execute `cmake .` in this project's directory. CMake will generate Visual Studio solution file automatically.
To run the code in example directory with PL/0, just run the executable binary:
pl0 ./example/prime.txtHow to see the bytecode?
If you want to see the bytecode generated by interpreter internally, just type the same command with `--show-bytecode`:pl0 --show-bytecode ./example/prime.txtHow to visualize the syntax tree?
What's more, if you want to visualize the abstract syntax tree, just add `--plot-tree tree.gv` and then use dot to compile generated file into picture:pl0 --plot-tree tree.gv ./example/prime.txt
dot -o tree.png -T png tree.gvThen open tree.png to see the result.
Are there more options?
Built binary of PL/0 interpreter has few options:--compile-only: compile but not run the code--show-bytecode: print bytecode after generating the code--show-ast: print ast after generating the ast--plot-tree [output_file]: save DOT (a graphics description language) intooutput_file, you can generate a picture of the ast by graphviz.
In this section, the target instruction set will be demonstrated. The target runtime environment is a stack-based machine. There are four register and a stack in the target machine.
The purpose of four registers are listed below:
IPholds the instruction being executed.PCis program counter.SPrefers the top of the stack.BPrefers the base of current stack frame.
Stack has two purposes: allocate variables and being used as evaluation stack.
Stack is composed of many consecutive storage unit. In order to gain a deeper understanding, we can imagine that stack is composed of many stack frames and each stack frame is composed of many storage units.
When a procedure is called, a new stack frame will be placed at the top of the stack. Vice versa, the stack frame will be removed when the procedure is returned.
But what is inside the stack frame? At the bottom of the stack frame, there are three variables:
- Static link is the
BPregister of the procedure in which this procedure is called. - Dynamic link is the
BPregister of the procedure in which this procedure is declared. - Return address refers to the next instruction when this procedure is returned.
Local variables which declared in this procedure are located beyond three variables. Those are called static zone. Beyond the static zone there is dynamic zone, which is served as evaluation stack.
The instruction consists of three parts: opcode, level, address. There are seven opcodes, which is listed below.
LIT: Load a immediate value onto the stack. The level field in instruction is unused. The address field holds the immediate value.LOD: Load a variable onto the stack. The level fields indicates the distance from current stack frame to the stack frame where target variable locates. The address field is the index of target variable.STO: Store the value on the top of the stack to a variable. Two fields acts the same asLOD.CAL: Call a procedure. The level fields indicates the distance from current stack frame to the stack frame where the callee procedure is defined. The address field is the address of first instruction in the callee procedure.INT: Allocate some variables at the top of evaluation stack. The level field is unused. The address field is the count of local variables.JMP: Unconditionally jump to the address given in address field. The level field is unused.JPC: If the value at top of evaluation is falsy (i.e. zero), jump to the address given in address field. The level field is unused.OPR: Do the operation decided by the address field.
MIT