greati / mini-java-compiler Goto Github PK

Create nodes for each construction.

Search for "locations" in https://www.freebsd.org/cgi/man.cgi?query=yacc&sektion=1

• Parsing theory (Top-Down parsing, LL(1) grammars; FIRST and FOLLOW; Recursive parsers; Nonrecursive parsers)
• How did we change our grammar to make it LL(1)? (left recursion elim; left-factoring; more terminals, like @ and [])
• Our LL(1) grammar + checker results + parse table

Having the C++ parsing table, just implement the nonrecursive parser.

Possible sections:

• valid identifiers
• data types
• possible expressions (arithmetic, logic and relational)
• variable declaration and initialization
• constant declaration (MiniJava does not support constant variables, only litereals)
• assignments
• conditional structures
• repetition structures
• method/function declaration and calls
• statement blocks
• classes
• IO (print and read)
• comments

Take a look at the std::unordered_multimap for hash tables with buckets.

Remember the beginScope() and endScope() functions in the symbol table interface.

Remember the global scope stack to be manipulated by beginScape() and endScope() functions.

• Lexer class
• Abstract parser class
• Concrete parser classes

Red Tiger gives some clues.

• gather list of tokens
• declare tokens in an enum
• implement lexer

• Merge Sort

• Quick Sort

• Binary Search

A stack with frame pointer (FP) and stack pointer (SP).