Teacher Quan — Private Computer Science Teacher

Candidates should be able to

Theory
  • Show understanding of how an interpreter can execute programs without producing a translated version
  • Show understanding of the various stages in the compilation of a program
    • Including lexical analysis, syntax analysis, code generation and optimisation
  • Show understanding of how the grammar of a language can be expressed using syntax diagrams or Backus-Naur Form (BNF) notation
  • Show understanding of how Reverse Polish Notation (RPN) can be used to carry out the evaluation of expressions