This is a class project I wrote as an undergraduate. The language's grammar was provided to us in EBNF. We were asked to implement it as an interpreter/compiler combo.
WARNING: The parser currently segfaults (double-free) after giving output. I need to come back and fix everything one of these days.
- Build using GNU make, then invoke the sc executable.
- If a file name is given, that file is processed. Otherwise, the standard input is processed.
- One of the following options is allowed
- No flags: Compiles the source code into ARM assembly.
- -s flag: Runs the scanner, or more commonly called the lexer. That is, prints the list of tokens.
- -c flag: Prints the concrete syntax tree. As in, the parse tree.
- -t flag: Prints the symbol table. Symbol table may be buggy if complicated records/arrays structures are involved.
- -a flag: Prints the abstract syntax tree.
- -i flag: Runs the interpreter. Unfortunately this is NYI.
Code examples can be found in the examples folder.
If you happen to be taking the same class, please do not cheat off of this. This code doesn't work very well anyways.
To quote the man himself directly: "If you try to use this for homework, you can be certain that your instructor will find the matching code here and bust you. But your instructor may not be able to bust me because I might have graduated already. Ha-ha!"
- Fix the bugs... does this thing even work most of the time?
- Get rid of the stupid
uintptr_tshenanigans somehow. - Don't use ancient C++. Use smart pointers, enum classes, and variants.
- Actually write the interpreter
- Write code generation for x86