Tests : 3540 pased
Nova is a handwritten compiler in C#, in which you can solve expressions, write function and variables, and execute them.
The main structure is divided in: Syntax Trees, Symbols, Binder and Flow Analysis that are showed by the Emit.
Nova Compiler has a REPL that handle the compilation of the code, and add some characteristics like:
The input source code is represented by tokens, so the document can identify each token and render it by colors.
The input source code is handler by a document that allow:
- Multiline
- Back to edit
- Add new line between the code
- Browse history
#showTree- Render the syntax tree representation of input.#showProgram- Render the structure created by semantic analysis.#cls- Clean the screen.#reset- Clean the variables declared in the scope.
The Syntax Tree represent the lexical and syntactic structure of source code.
- Hold all the source information in full fidelity.
- Divide the source in lexical tokens.
- Parse tokens for grammatical construct.
- Represent errors in source code when the program is incomplete or malformed.
- Syntax trees can be used as a way to construct and edit source text.
Each syntax tree is made up of nodes, tokens, and trivia.
- Nodes: Represent syntactic constructs (Declarations, Statements, and Expressions)
- Tokens: Represent the smallest syntactic fragments of the code (Keywords, Identifiers, Literals, and Punctuation)
- Trivia: Source text insignificant (Whitespace)
Checks the semantic consistency of the code. It uses the syntax tree of the previous phase along with the symbol table to verify that the given source code is semantically consistent.
Functions of semantic analysis:
- Helps you to store type information gathered and save it in symbol table or syntax tree.
- In the case of type mismatch a semantic error is shown.
- Collects type information and checks for type compatibility.
- Checks if the source language permits the operands or not.
- Identify the unary and binary expressions.
A symbol table contains a record for each identifier with fields for the attributes of the identifier. This component makes it easier for the compiler to search the identifier record and retrieve it quickly.
Every namespace, type, method, property, field, parameter, or local variable is represented by a symbol.
Nova compiler create a graph that represents the control flow of the function or expressions executed.
- All nodes in the graph are called basic blocks.
- Basic block is a list of statements that are executed in sequence.
In each phases of the compiler errors are catch by a diagnostic bag that return the fauld details.
