diff options
| author | Yann Herklotz <ymherklotz@gmail.com> | 2017-03-01 17:18:54 +0000 |
|---|---|---|
| committer | Yann Herklotz <ymherklotz@gmail.com> | 2017-03-01 17:18:54 +0000 |
| commit | 9e761324895d098a87f0ba66b7eb1794cd3ed6b4 (patch) | |
| tree | b46b0eb0eb91f6784d586acb8611495de81b92e4 /Notes.org | |
| parent | 2e5cacc6633a6973f8e96adc6bafa633487fc2a1 (diff) | |
| download | Compiler-9e761324895d098a87f0ba66b7eb1794cd3ed6b4.tar.gz Compiler-9e761324895d098a87f0ba66b7eb1794cd3ed6b4.zip | |
Finished parser
Diffstat (limited to 'Notes.org')
| -rw-r--r-- | Notes.org | 40 |
1 files changed, 27 insertions, 13 deletions
@@ -11,7 +11,8 @@ *** Task - We had to calculate statistics over text. This was to learn about flex and how to use it. + We had to calculate statistics over text. This was to learn about + flex and how to use it. ** DONE Coursework (c lexer) @@ -19,8 +20,8 @@ *** Task - Design a C lexer that could lex C and output the important information about the C code. This made us read the - C spec for the first time. + Design a C lexer that could lex C and output the important information + about the C code. This made us read the C spec for the first time. * Parser @@ -30,26 +31,32 @@ *** Task - We had to design a maths parser and then analyse the tree that was created by parsing it. The additional parts where - to differentiate equations using the different rules for differentiating. We also had to evaluate the expressions and - do other operations on the tree. This taught us how to use bison. + We had to design a maths parser and then analyse the tree that was + created by parsing it. The additional parts where to differentiate + equations using the different rules for differentiating. We also had to + evaluate the expressions and do other operations on the tree. This taught + us how to use bison. ** TODO Coursework (c parser) DEADLINE: <2017-03-07 Tue> +*** Task + *** AST (Abstract Syntax Tree) - Finsihed the AST for now, using polymorphism to achieve this. Right now it achieves the goal of this coursework - as it does print out the AST in xml format and supports all the features that the parser should support. The - expressions branch of the AST is completely bare because they are not needed for this parser. I will continue working - on this AST in the compiler section so that it supports all the other constructs that I need for the compiler. + Finsihed the AST for now, using polymorphism to achieve this. Right now i + t achieves the goal of this coursework as it does print out the AST in xml + format and supports all the features that the parser should support. The + expressions branch of the AST is completely bare because they are not needed + for this parser. I will continue working on this AST in the compiler section + so that it supports all the other constructs that I need for the compiler. *** Grammar - The grammar is not completely done yet as I dont support all of the declartions that are possible, and as I add more - constructs in the AST I will also have to add declarations in the bison file. This I will only continue in the Compiler - section. + The grammar is not completely done yet as I dont support all of the declartions + that are possible, and as I add more constructs in the AST I will also have to add + declarations in the bison file. This I will only continue in the Compiler section. * Compiler @@ -57,6 +64,13 @@ ** DONE Lab (codegen) DEADLINE: <2017-02-28 Tue> +*** Task + + In this lab we used the setup provided to us to make a compiler for the language + specified in the lab. The AST was already built for us and the language was already + parsed using C++ instead of bison. + + ** TODO Coursework (c compiler) DEADLINE: <2017-03-28 Tue> |