Computer Engineering is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Computer Engineering

Compiler Design

Lexical analysis, parsing, syntax-directed translation, intermediate code, run-time storage, code optimisation and generation.

Interview questions
Notes for Compiler Design are being written and reviewed. Until they're up, Aria teaches every topic — ask for any part of the syllabus, with worked numericals.

Coming next in Compiler Design

  1. Language processors: compilers, interpreters, assemblers, linkers and loaders· notes coming
  2. Phases of a compiler· notes coming
  3. Front end, back end and passes· notes coming
  4. Role of the lexical analyser and input buffering· notes coming
  5. Specifying and recognising tokens· notes coming
  6. Lex and Flex· notes coming
  7. Regular expressions to automata for lexers· notes coming
  8. Optimising the lexer DFA· notes coming
  9. Top-down parsing: recursive descent and LL(1)· notes coming
  10. Bottom-up parsing and shift-reduce· notes coming
  11. Operator-precedence parsing· notes coming
  12. LR parsers: SLR, CLR and LALR· notes coming
  13. Parser generators: YACC and Bison· notes coming
  14. Syntax-directed definitions and translation schemes· notes coming
  15. S-attributed and L-attributed definitions· notes coming
  16. Error detection and recovery in compilers· notes coming
  17. Intermediate code: syntax trees, postfix and three-address code· notes coming
  18. Translating to three-address code· notes coming
  19. Backpatching· notes coming
  20. Run-time storage organisation and activation records· notes coming
  21. Storage allocation strategies· notes coming
  22. Access to non-local names and parameter passing· notes coming
  23. Dynamic storage allocation· notes coming
  24. Symbol tables: entries, implementation and scopes· notes coming
  25. Basic blocks and flow graphs· notes coming
  26. Data-flow analysis· notes coming
  27. Machine-independent optimisations· notes coming
  28. Code generator design and the target machine· notes coming
  29. Register allocation and assignment· notes coming
  30. DAG representation of basic blocks· notes coming
  31. Peephole optimisation· notes coming
  32. Type checking· notes coming
  33. Bootstrapping and compiler-construction tools· notes coming
  34. FIRST and FOLLOW sets and predictive parsing tables· notes coming
  35. Type equivalence and type conversions· notes coming
  36. Quadruples, triples and indirect triples· notes coming
  37. Loop optimisation: code motion, induction variables, unrolling and jamming· notes coming
  38. Instruction scheduling for pipelines· notes coming