1 Pictures from teh Starting Forth book |
1 Compiler courses |
|
2 http://www.cse.chalmers.se/edu/year/2017/course/TDA283/lectures/ |
|
3 http://www.cs.columbia.edu/~sedwards/classes/2017/4115-fall/index.html |
|
4 http://www.cs.dartmouth.edu/~mckeeman/cs48/index.html |
|
5 =============================== |
|
6 |
|
7 Pictures from the Starting Forth book |
2 |
8 |
3 https://www.forth.com/starting-forth/2-stack-manipulation-operators-arithmetic/ |
9 https://www.forth.com/starting-forth/2-stack-manipulation-operators-arithmetic/ |
4 |
10 |
5 -------------------------------- |
11 -------------------------------- |
|
12 Java Byte Code for SCALA |
|
13 https://www.toptal.com/scala/scala-bytecode-and-the-jvm |
6 |
14 |
|
15 ------------------ |
7 Yeti - ML for the JVM |
16 Yeti - ML for the JVM |
8 https://mth.github.io/yeti/ |
17 https://mth.github.io/yeti/ |
9 http://dot.planet.ee/yeti/intro.html |
18 http://dot.planet.ee/yeti/intro.html |
|
19 |
|
20 ------------------ |
|
21 Ocaml for LLVM |
|
22 https://github.com/artagnon/rhine-ml |
|
23 |
|
24 --------------- |
|
25 Type inference |
|
26 http://www.calebh.io/Type-Inference-by-Solving-Constraints/ |
|
27 |
10 |
28 |
11 |
29 |
12 JVM languages |
30 JVM languages |
13 https://en.wikipedia.org/wiki/List_of_JVM_languages |
31 https://en.wikipedia.org/wiki/List_of_JVM_languages |
14 https://www.codeproject.com/Articles/50377/Create-Your-Own-Programming-Language |
32 https://www.codeproject.com/Articles/50377/Create-Your-Own-Programming-Language |
65 http://www.red-lang.org/p/about.html |
83 http://www.red-lang.org/p/about.html |
66 http://craftinginterpreters.com/contents.html |
84 http://craftinginterpreters.com/contents.html |
67 https://michaelhaywoodblog.wordpress.com |
85 https://michaelhaywoodblog.wordpress.com |
68 https://ruslanspivak.com/lsbasi-part1/ |
86 https://ruslanspivak.com/lsbasi-part1/ |
69 http://selfie.cs.uni-salzburg.at |
87 http://selfie.cs.uni-salzburg.at |
|
88 https://academy.realm.io/posts/tryswift-samuel-giddins-building-tiny-compiler-swift-ios/ |
|
89 https://legacy.gitbook.com/book/luxlang/the-lux-programming-language/details |
|
90 https://github.com/rhysd/gocaml |
|
91 https://github.com/aalhour/awesome-compilers#educational-and-toy-projects |
|
92 https://rsms.me/hue-intro |
70 |
93 |
71 |
94 |
72 automata |
95 automata |
73 https://www7.in.tum.de/um/courses/auto/ws1314/script/autonotes.pdf |
96 https://www7.in.tum.de/um/courses/auto/ws1314/script/autonotes.pdf |
74 |
97 |
98 |
121 |
99 |
122 |
100 |
123 |
101 Static code analysis |
124 Static code analysis |
102 https://medium.com/@Coder_HarryLee/videos-about-static-code-analysis-7654b40f9a3b |
125 https://medium.com/@Coder_HarryLee/videos-about-static-code-analysis-7654b40f9a3b |
|
126 |
|
127 |
|
128 Brainfuck compiler |
|
129 https://github.com/PurpleMyst/bf_compiler |
|
130 https://www.reddit.com/r/programming/comments/8371tk/a_brainfuck_to_llvm_ir_compiler_written_in_python/ |
|
131 http://www.wilfred.me.uk/blog/2015/02/21/my-first-llvm-compiler/ |
|
132 |
|
133 =============================== |
|
134 A simple recursive regular expression matcher written in Scala. |
|
135 https://github.com/marconilanna/RegexMatcher |
|
136 |
|
137 =============================== |
|
138 A neat little tool to build presentations using the Scala REPL |
|
139 https://github.com/marconilanna/REPLesent |
|
140 |
|
141 |
|
142 ====================== |
|
143 Minimal Static Single Assignment Form |
|
144 Max Wagner and Denis Lohner |
|
145 |
|
146 This formalization is an extension to "Verified Construction of Static Single |
|
147 Assignment Form". In their work, the authors have shown that Braun et al.'s |
|
148 static single assignment (SSA) construction algorithm produces minimal SSA form |
|
149 for input programs with a reducible control flow graph (CFG). However Braun et |
|
150 al. also proposed an extension to their algorithm that they claim produces |
|
151 minimal SSA form even for irreducible CFGs. |
|
152 In this formalization we support that claim by giving a mechanized proof. |
|
153 |
|
154 As the extension of Braun et al.'s algorithm aims for removing so-called |
|
155 redundant strongly connected components of phi functions, we show that this |
|
156 suffices to guarantee minimality according to Cytron et al.. |
|
157 |
|
158 https://www.isa-afp.org/entries/Minimal_SSA.shtml |
|
159 |
|
160 |