From be7a75fddca7c2943fc2f30a46c485e1e9d333fc Mon Sep 17 00:00:00 2001 From: Siraaj Khandkar Date: Tue, 29 May 2018 22:40:35 -0400 Subject: [PATCH] Update project status --- README.md | 48 ++++++++++++++++++++++++------------------------ 1 file changed, 24 insertions(+), 24 deletions(-) diff --git a/README.md b/README.md index cda2fd7..4a57bc6 100644 --- a/README.md +++ b/README.md @@ -8,41 +8,41 @@ Project Plan |--------|------------|------------------------------------------|-------|----------|--------|------------|------------| | [-] | 0 | Modern Compiler Implementation in ML | 512 | 28-84 | -- | 2018-04-16 | xxxx-xx-xx | | ====== | ========== | ======================================== | ===== | ======== | ====== | ========== | ========== | -| [-] | 1 | - Fundamentals of Compilation | 264 | 14 | -- | 2018-04-16 | ---------- | -| [-] | 1.01 | -- Introduction | 011 | 01 | 04 | 2018-04-16 | ---------- | +| [x] | 1 | - Fundamentals of Compilation | 264 | 14 | -- | 2018-04-16 | ---------- | +| [x] | 1.01 | -- Introduction | 011 | 01 | 04 | 2018-04-16 | ---------- | | [x] | 1.01.1 | --- Modules and interfaces | 001 | -- | -- | 2018-04-16 | ---------- | | [x] | 1.01.2 | --- Tools and Software | 002 | -- | -- | 2018-04-16 | ---------- | | [x] | 1.01.3 | --- Data structures for tree languages | 003 | -- | -- | 2018-04-16 | ---------- | | [x] | 1.01.p | --- Program | 002 | -- | -- | 2018-04-16 | 2018-04-17 | | [x] | 1.01.p.1 | ---- interpreter: maxargs | --- | -- | -- | 2018-04-17 | 2018-04-17 | | [x] | 1.01.p.2 | ---- interpreter: interp | --- | -- | -- | 2018-04-17 | 2018-04-17 | -| [-] | 1.01.e | --- Exercises | 002 | -- | -- | ---------- | ---------- | +| [x] | 1.01.e | --- Exercises | 002 | -- | -- | ---------- | ---------- | | [x] | 1.01.e.1.a | ---- tree member | --- | -- | -- | 2018-04-17 | 2018-04-17 | | [x] | 1.01.e.1.b | ---- tree key/val | --- | -- | -- | 2018-04-18 | 2018-04-18 | | [x] | 1.01.e.1.c | ---- demo unbalanced behaviour | --- | -- | -- | 2018-04-18 | 2018-04-18 | | [x] | 1.01.e.1.d | ---- find functional balanced tree | --- | -- | -- | 2018-04-19 | 2018-04-20 | | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- | -| [ ] | 1.02 | -- Lexical Analysis | 024 | 01 | 01 | 2018-05-22 | 2018-05-22 | -| [ ] | 1.02.1 | --- Lexical tokens | 001 | -- | -- | ---------- | ---------- | -| [ ] | 1.02.2 | --- Regular expressions | 003 | -- | -- | ---------- | ---------- | -| [ ] | 1.02.3 | --- Finite automata | 003 | -- | -- | ---------- | ---------- | -| [ ] | 1.02.4 | --- Nondeterministic finite automata | 006 | -- | -- | ---------- | ---------- | -| [ ] | 1.02.5 | --- ML-Lex: a lexical analyzer generator | 003 | -- | -- | ---------- | ---------- | -| [ ] | 1.02.p | --- Program | 002 | -- | -- | ---------- | ---------- | -| [ ] | 1.02.p.1 | ---- Tiger lexer | --- | 01 | 01 | 2018-05-22 | 2018-05-22 | -| [ ] | 1.02.e | --- Exercises | 004 | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.01 | ---- regexes | --- | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.02 | ---- why no regexes | --- | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.03 | ---- explain automata | --- | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.04 | ---- regex to nondeterministic automata | --- | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.05 | ---- NFA to DFA | --- | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.06 | ---- merge equivalent automata states | --- | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.07 | ---- DFA to regex | --- | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.08 | ---- analyze lexer based on given DFA | --- | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.09 | ---- generate lexer tables from spec | --- | -- | -- | ---------- | ---------- | -| [ ] | 1.02.e.10 | ---- design better lookahead than Aho | --- | -- | -- | ---------- | ---------- | -| ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- | -| [ ] | 1.03 | -- Parsing | 049 | 02 | -- | ---------- | ---------- | +| [x] | 1.02 | -- Lexical Analysis | 024 | 01 | 01 | 2018-05-22 | 2018-05-22 | +| [x] | 1.02.1 | --- Lexical tokens | 001 | -- | -- | ---------- | ---------- | +| [x] | 1.02.2 | --- Regular expressions | 003 | -- | -- | ---------- | ---------- | +| [x] | 1.02.3 | --- Finite automata | 003 | -- | -- | ---------- | ---------- | +| [x] | 1.02.4 | --- Nondeterministic finite automata | 006 | -- | -- | ---------- | ---------- | +| [x] | 1.02.5 | --- ML-Lex: a lexical analyzer generator | 003 | -- | -- | ---------- | ---------- | +| [x] | 1.02.p | --- Program | 002 | -- | -- | ---------- | ---------- | +| [x] | 1.02.p.1 | ---- Tiger lexer | --- | 01 | 01 | 2018-05-22 | 2018-05-22 | +| [x] | 1.02.e | --- Exercises | 004 | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.01 | ---- regexes | --- | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.02 | ---- why no regexes | --- | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.03 | ---- explain automata | --- | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.04 | ---- regex to nondeterministic automata | --- | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.05 | ---- NFA to DFA | --- | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.06 | ---- merge equivalent automata states | --- | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.07 | ---- DFA to regex | --- | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.08 | ---- analyze lexer based on given DFA | --- | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.09 | ---- generate lexer tables from spec | --- | -- | -- | ---------- | ---------- | +| [x] | 1.02.e.10 | ---- design better lookahead than Aho | --- | -- | -- | ---------- | ---------- | +| ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- | +| [x] | 1.03 | -- Parsing | 049 | 02 | 04 | 2018-05-25 | 2018-05-29 | | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- | | [ ] | 1.04 | -- Abstract Syntax | 016 | 01 | -- | ---------- | ---------- | | ------ | ---------- | ---------------------------------------- | ----- | -------- | ------ | ---------- | ---------- | -- 2.20.1