1. MATLAB objects using nested functions MathWorks Compiler Course – Day 2

2. MATLAB objects using nested functions The structure of xcom MathWorks Compiler Course – Day 2

3. The structure of xcom MathWorks Compiler Course – Day 2 Analysis Synthesis Runtime IR – syntax tree + symbols EXE – link&go results X X.cfg

4. The structure of Analysis MathWorks Compiler Course – Day 2 Cfg Lexer Parser Tree Symbols X.cfg Cfg tables lexemes shift/reduce sequence syntax tree symbol table X

5. The structure of Cfg MathWorks Compiler Course – Day 2 X.cfg V N V I Π heads rule names, lengths Cfg cfg.mat reserved words, ops

6. Notation supporting grammars MathWorks Compiler Course – Day 2

7. Notation supporting grammars –Definitions MathWorks Compiler Course – Day 2

8. Notation supporting grammars –Definitions –Greek alphabet MathWorks Compiler Course – Day 2

9. Notation supporting grammars –Definitions –Greek alphabet –Propositional and Predicate Logic MathWorks Compiler Course – Day 2

10. Notation supporting grammars –Definitions –Greek alphabet –Propositional and Predicate Logic –Sets MathWorks Compiler Course – Day 2

11. Notation supporting grammars –Definitions –Greek alphabet –Propositional and Predicate Logic –Sets –Ordered pairs and tuples MathWorks Compiler Course – Day 2

12. Notation supporting grammars –Definitions –Greek alphabet –Propositional and Predicate Logic –Sets –Ordered pairs and tuples –Sequences MathWorks Compiler Course – Day 2

13. Notation supporting grammars –Definitions –Greek alphabet –Propositional and Predicate Logic –Sets –Ordered pairs and tuples –Sequences –Relations MathWorks Compiler Course – Day 2

14. Notation supporting grammars Context-free Grammars MathWorks Compiler Course – Day 2

15. Notation supporting grammars Context-free Grammars –Phrase structure MathWorks Compiler Course – Day 2

16. Notation supporting grammars Context-free Grammars –Phrase structure –Reduction rules MathWorks Compiler Course – Day 2

17. Notation supporting grammars Context-free Grammars –Phrase structure –Reduction rules –Doing reductions MathWorks Compiler Course – Day 2

18. Notation supporting grammars Context-free Grammars –Phrase structure –Reduction rules –Doing reductions –Syntax tree MathWorks Compiler Course – Day 2

19. Notation supporting grammars Context-free Grammars –Phrase structure –Reduction rules –Doing reductions –Syntax tree –Everyday notation for CFGs MathWorks Compiler Course – Day 2

20. Notation supporting grammars Context-free Grammars –Reduction rules –Doing reductions –Syntax tree –Everyday notation for CFGs –Rule names, numbers MathWorks Compiler Course – Day 2

21. Notation supporting grammars Context-free Grammars –Doing reductions –Syntax tree –Everyday notation for CFGs –Rule names, numbers –Formal definition of CFG MathWorks Compiler Course – Day 2

22. Notation supporting grammars Context-free Grammars –Doing reductions –Syntax tree –Everyday notation for CFGs –Rule names, numbers –Formal definition of CFG –Derive CFG from Π alone MathWorks Compiler Course – Day 2

23. Notation supporting grammars Context-free Grammars –Syntax tree –Everyday notation for CFGs –Rule names, numbers –Formal definition of CFG –Derive CFG from Π alone –Formal definition of language MathWorks Compiler Course – Day 2

24. Notation supporting grammars Context-free Grammars –Everyday notation for CFGs –Rule names, numbers –Formal definition of CFG –Derive CFG from Π alone –Formal definition of language –Left to right parsing MathWorks Compiler Course – Day 2

25. Notation supporting grammars Context-free Grammars –Rule names, numbers –Formal definition of CFG –Derive CFG from Π alone –Formal definition of language –Left to right parsing –Restrictions on CFGs MathWorks Compiler Course – Day 2

26. Notation supporting grammars Context-free Grammars –Formal definition of CFG –Derive CFG from Π alone –Formal definition of language –Left to right parsing –Restrictions on CFGs –Transforming CFGs MathWorks Compiler Course – Day 2

27. Notation supporting grammars Context-free Grammars –Derive CFG from Π alone –Formal definition of language –Left to right parsing –Restrictions on CFGs –Transforming CFGs –Free-form CFGs MathWorks Compiler Course – Day 2

28. Notation supporting grammars Context-free Grammars –Formal definition of language –Left to right parsing –Restrictions on CFGs –Transforming CFGs –Free-form CFGs –A grammar-grammar MathWorks Compiler Course – Day 2

29. Notation supporting grammars Context-free Grammars Regular Expressions MathWorks Compiler Course – Day 2

30. Notation supporting grammars Context-free Grammars Regular Expressions Finite Automata MathWorks Compiler Course – Day 2

31. Notation supporting grammars Context-free Grammars Regular Expressions Finite Automata –State-transition diagrams MathWorks Compiler Course – Day 2

32. Notation supporting grammars Context-free Grammars Regular Expressions Finite Automata (FA) –State-transition diagrams –CFG for FA MathWorks Compiler Course – Day 2

33. Notation supporting grammars Context-free Grammars Regular Expressions Finite Automata (FA) –State-transition diagrams –CFG for FA Deterministic (DFA) MathWorks Compiler Course – Day 2

34. Notation supporting grammars Context-free Grammars Regular Expressions Finite Automata (FA) –State-transition diagrams –CFG for FA Deterministic (DFA) Nondeterministic (NFA) MathWorks Compiler Course – Day 2

35. Context-free Grammars Regular Expressions Finite Automata (FA) –State-transition diagrams –CFG for FA Deterministic (DFA) Nondeterministic (NFA) –NFA to DFA MathWorks Compiler Course – Day 2

36. Regular Expressions Finite Automata (FA) –State-transition diagrams –CFG for FA Deterministic (DFA) Nondeterministic (NFA) –NFA to DFA Regular Expression Grammars (REG) MathWorks Compiler Course – Day 2

37. Finite Automata (FA) –State-transition diagrams –CFG for FA Deterministic (DFA) Nondeterministic (NFA) –NFA to DFA Regular Expression Grammars (REG) –REG grammar-grammar MathWorks Compiler Course – Day 2

38. Finite Automata (FA) Regular Expression Grammars (REG) –REG grammar-grammar –Rewriting REGs MathWorks Compiler Course – Day 2

39. Finite Automata (FA) Regular Expression Grammars (REG) –REG grammar-grammar –Rewriting REGs I/O Grammars (IOG) MathWorks Compiler Course – Day 2

40. Finite Automata (FA) Regular Expression Grammars (REG) –REG grammar-grammar –Rewriting REGs I/O Grammars (IOG) –Formal Definition of IOG MathWorks Compiler Course – Day 2

41. Regular Expression Grammars (REG) –REG grammar-grammar –Rewriting REGs I/O Grammars (IOG) –Formal Definition of IOG –IOG grammar-grammar MathWorks Compiler Course – Day 2

42. Regular Expression Grammars (REG) –REG grammar-grammar –Rewriting REGs I/O Grammars (IOG) –Formal Definition of IOG –IOG grammar-grammar –Rewriting IOGs MathWorks Compiler Course – Day 2

43. Regular Expression Grammars (REG) –REG grammar-grammar –Rewriting REGs I/O Grammars (IOG) –Formal Definition of IOG –IOG grammar-grammar –Rewriting IOGs Grammars for X, C and Java MathWorks Compiler Course – Day 2