Assume that it is easier
Write more text, draw diagrams on automaton
Need to be strong in theory
100% Regex is there
- Formal Languages
- Tokens
- Sentences
- Regular Grammar
- Regular Expressions
Definition of token sentences, Regex
- Production Rules
- Grammars
- Terminology
- Object Language (strings of terminals)
- Meta-language (all strings of terminals or nonterminal)
- Chomskky classification of grammar
- Type 2 (context-free) language
- Type 3 (regular) grammar
- Leftmost derivation
- Rightmost derivation
- Ambiguous grammars
- Unambiguous grammars
- Eliminate ambiguity
- Left-recursive ambiguity
- Right-recursive ambiguity
- Convert left-recursive to right-recursive
- Top-down parsing (left-most derivation)
- Nondeterminisism
- Eliminate nondeterminism by left-factoring
- DFA
- Definition
- Transition diagrams
- Extended transition function
- NFA
- Def
- Transition diagrams
- Extended transition function
- Converting an NFA to a DFA
- What is a Compilter?
- What is an Interpreter?
- Interpreter VS Compiler
- Write a simple interpreter (can be pseudo-code or semi-OCaml)
- The process of the Lexer Generator
- Write a simple Lex File (write on a piece of paper)
- The process of making a
.cmofile
- Recursive Descent Parser
- Abstract grammar to Abstract Syntax to Concrete Syntax
- LL(1) Grammars
- Why can it not be LL(1)?
- Read and Understand MIPS
- Explain the process of Code generation
- Optimisation
- Explain the process of optimisation
- Elaborate the process using pseudo-code
HINT: If you are not confident in the 3rd question,
If someone answers all 4 questions, all 4 are marked and the highest will be chosen
The exam is designed to complete 3 questions
Answer the question which you are confident in getting the most marks.
Prioritise your question based on how confident you are in the questions.
3 good questions are better than 4 meh questions.
If you find yourself with less time, attempt the last question.