I’ve tried in the past to work out what a valid name looks like in CIL so I can implement it in my Turing.Net compiler and never got very far. Today I decided to just knuckle down and plow through the ECMA Specification. It’s actually rather interesting, and I eventually came across section 8.5.1 Valid [...]
I’ve been reading through the Ecma specification for the CLI in order to find out some things for Turing.Net and came across an interesting little fact, represented by the following code: Console.WriteLine(float.NaN.Equals(float.NaN)); // True Console.WriteLine(float.NaN == float.NaN); // False This is because, under the contract for type value, equality identity implies equality. However, “two floating [...]
I’ve had a few issues with moving from VS2008 beta 2 to the release version, so have not really been able to progress with the code for IronTuring. This has lead me to step back and think a little harder about the syntax I am using in terms of implementation (I know design and implementation [...]
I've been wanting to look into compilers (lexer and parser) for a while now, and recently decided to scratch my itch and design and write the compiler for a toy language I've called IronTuring. The language defines a simple Turing machine (a variation of a Finite State Automaton) which can then be compiled either into [...]