Complete 1.01.e.1.c: demo unbalanced behaviour
[tiger.ml.git] / README.md
1 Tiger.ml
2 ========
3
4 Project Plan
5 ------------
6
7 | status | id | title | pages | estimate | actual | start | finish |
8 |--------|------------|------------------------------------------|-------|----------|--------|------------|------------|
9 | [-] | 0 | Modern Compiler Implementation in ML | 512 | 28-84 | -- | 2018-04-16 | xxxx-xx-xx |
10 | ====== | ========== | ======================================== | ===== | ======== | ====== | ========== | ========== |
11 | [-] | 1 | - Fundamentals of Compilation | 264 | 14 | -- | 2018-04-16 | ---------- |
12 | [-] | 1.01 | -- Introduction | 011 | 01 | -- | 2018-04-16 | ---------- |
13 | [x] | 1.01.1 | --- Modules and interfaces | 001 | -- | -- | 2018-04-16 | ---------- |
14 | [x] | 1.01.2 | --- Tools and Software | 002 | -- | -- | 2018-04-16 | ---------- |
15 | [x] | 1.01.3 | --- Data structures for tree languages | 003 | -- | -- | 2018-04-16 | ---------- |
16 | [x] | 1.01.p | --- Program | 002 | -- | -- | 2018-04-16 | 2018-04-17 |
17 | [x] | 1.01.p.1 | ---- interpreter: maxargs | --- | -- | -- | 2018-04-17 | 2018-04-17 |
18 | [x] | 1.01.p.2 | ---- interpreter: interp | --- | -- | -- | 2018-04-17 | 2018-04-17 |
19 | [-] | 1.01.e | --- Exercises | 002 | -- | -- | ---------- | ---------- |
20 | [x] | 1.01.e.1.a | ---- tree member | --- | -- | -- | 2018-04-17 | 2018-04-17 |
21 | [x] | 1.01.e.1.b | ---- tree key/val | --- | -- | -- | 2018-04-18 | 2018-04-18 |
22 | [x] | 1.01.e.1.c | ---- demo unbalanced behaviour | --- | -- | -- | 2018-04-18 | 2018-04-18 |
23 | [ ] | 1.01.e.1.d | ---- find functional balanced tree | --- | -- | -- | ---------- | ---------- |
24 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
25 | [ ] | 1.02 | -- Lexical Analysis | 024 | 01 | -- | ---------- | ---------- |
26 | [ ] | 1.02.1 | --- Lexical tokens | 001 | -- | -- | ---------- | ---------- |
27 | [ ] | 1.02.2 | --- Regular expressions | 003 | -- | -- | ---------- | ---------- |
28 | [ ] | 1.02.3 | --- Finite automata | 003 | -- | -- | ---------- | ---------- |
29 | [ ] | 1.02.4 | --- Nondeterministic finite automata | 006 | -- | -- | ---------- | ---------- |
30 | [ ] | 1.02.5 | --- ML-Lex: a lexical analyzer generator | 003 | -- | -- | ---------- | ---------- |
31 | [ ] | 1.02.p | --- Program | 002 | -- | -- | ---------- | ---------- |
32 | [ ] | 1.02.p.1 | ---- Tiger lexer | --- | -- | -- | ---------- | ---------- |
33 | [ ] | 1.02.e | --- Exercises | 004 | -- | -- | ---------- | ---------- |
34 | [ ] | 1.02.e.01 | ---- regexes | --- | -- | -- | ---------- | ---------- |
35 | [ ] | 1.02.e.02 | ---- why no regexes | --- | -- | -- | ---------- | ---------- |
36 | [ ] | 1.02.e.03 | ---- explain automata | --- | -- | -- | ---------- | ---------- |
37 | [ ] | 1.02.e.04 | ---- regex to nondeterministic automata | --- | -- | -- | ---------- | ---------- |
38 | [ ] | 1.02.e.05 | ---- NFA to DFA | --- | -- | -- | ---------- | ---------- |
39 | [ ] | 1.02.e.06 | ---- merge equivalent automata states | --- | -- | -- | ---------- | ---------- |
40 | [ ] | 1.02.e.07 | ---- DFA to regex | --- | -- | -- | ---------- | ---------- |
41 | [ ] | 1.02.e.08 | ---- analyze lexer based on given DFA | --- | -- | -- | ---------- | ---------- |
42 | [ ] | 1.02.e.09 | ---- generate lexer tables from spec | --- | -- | -- | ---------- | ---------- |
43 | [ ] | 1.02.e.10 | ---- design better lookahead than Aho | --- | -- | -- | ---------- | ---------- |
44 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
45 | [ ] | 1.03 | -- Parsing | 049 | 02 | -- | ---------- | ---------- |
46 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
47 | [ ] | 1.04 | -- Abstract Syntax | 016 | 01 | -- | ---------- | ---------- |
48 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
49 | [ ] | 1.05 | -- Semantic Analysis | 021 | 01 | -- | ---------- | ---------- |
50 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
51 | [ ] | 1.06 | -- Activation Records | 024 | 01 | -- | ---------- | ---------- |
52 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
53 | [ ] | 1.07 | -- Translation to Intermediate Code | 025 | 01 | -- | ---------- | ---------- |
54 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
55 | [ ] | 1.08 | -- Basic Blocks and Traces | 013 | 01 | -- | ---------- | ---------- |
56 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
57 | [ ] | 1.09 | -- Instruction Selection | 025 | 01 | -- | ---------- | ---------- |
58 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
59 | [ ] | 1.10 | -- Liveness Analysis | 017 | 01 | -- | ---------- | ---------- |
60 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
61 | [ ] | 1.11 | -- Register Allocation | 030 | 02 | -- | ---------- | ---------- |
62 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
63 | [ ] | 1.12 | -- Putting It | 009 | 01 | -- | ---------- | ---------- |
64 | ====== | ========== | ======================================== | ===== | ======== | ====== | ---------- | ---------- |
65 | [ ] | 2 | - Advanced Topics | 245 | 14 | -- | ---------- | ---------- |
66 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
67 | [ ] | 2.13 | -- Garbage Collection | 026 | 02 | -- | ---------- | ---------- |
68 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
69 | [ ] | 2.14 | -- Object-Oriented Languages | 016 | 01 | -- | ---------- | ---------- |
70 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
71 | [ ] | 2.15 | -- Functional Programming Languages | 035 | 02 | -- | ---------- | ---------- |
72 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
73 | [ ] | 2.16 | -- Polymorphic Types | 033 | 02 | -- | ---------- | ---------- |
74 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
75 | [ ] | 2.17 | -- Dataflow Analysis | 027 | 02 | -- | ---------- | ---------- |
76 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
77 | [ ] | 2.18 | -- Loop Optimizations | 023 | 01 | -- | ---------- | ---------- |
78 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
79 | [ ] | 2.19 | -- Static Single-Assignment Form | 041 | 02 | -- | ---------- | ---------- |
80 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
81 | [ ] | 2.20 | -- Pipelining and Scheduling | 024 | 01 | -- | ---------- | ---------- |
82 | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- |
83 | [ ] | 2.21 | -- The Memory Hierarchy | 020 | 01 | -- | ---------- | ---------- |
This page took 0.069264 seconds and 5 git commands to generate.