A compiler consists of three pieces: A parser An abstract syntax tree (AST) An assembly code generator There are lots of nice parser generators that start with language grammars. Maybe ANTLR would be a good place for you to start. If you want to stick to C roots, try lex/yacc or bison. There are grammars … Read more
Erlang was designed for use in Telecommunication systems, where high-rel is fundamental. I think they have standard methodology for building sets of communicating processes in which failures can be gracefully handled. ERLANG is a concurrent functional language, well suited for distributed, highly concurrent and fault-tolerant software. An important part of Erlang is its support for … Read more
Bah – I can crash C in 5 characters: main; This declares an implicit int variable called ‘main’. It’s global so the variable has an initial value of 0. It’s C the names aren’t decorated – so the linker doesn’t realize that it’s a var and not a function. GCC gave me a warning – … Read more
Axiom K is also called the principle of uniqueness of identity proofs, and it is an axiom about the nature of the identity type in Martin-Löf’s dependent type theory. This type doesn’t exist (and in fact cannot be defined) in simpler type theories such as System F, so that is probably the reason why you … Read more
I’ve never personally encountered a stack overflow that wasn’t caused by infinite recursion. In these cases, a dynamic stack size wouldn’t help, it would just take a little longer to run out of memory.
I believe this notion comes from Lisp languages. Program written in Lisp consists of series of lists of lists of lists etc, like this: (defn f [x y] (+ x y)) Because of such uniformity it is possible to represent and manipulate such code as data, so the sequence of characters above is interpreted as … Read more
My usage can be divided into the following 5 categories. 1. interface 2. modularity 3. legibility 4. brevity 5. tricks If the variant type is only internal to the module, I use regular variants, because as you said they are compiled more efficiently. If the variant type is exported in the interface and I feel … Read more
One that’s fairly common is the infinite loop. I’d like to write it like this: forever { // … }
Lists of keywords in … ANSI COBOL 85: 357 SystemVerilog: 250 + 73 reserved system functions = 323 VHDL 2008: 115 reserved words C#: 79 + 23 contextual = 102 F#: 64 + 8 from ocaml + 26 future = 98 C++: 82 Dart: 54 Java: 50 (48 without unused keywords const and goto) PHP: … Read more
Here’s a list of a few interesting systems. It is not exhaustive! Dynamically typed and compiled The Gambit Scheme compiler, Chez Scheme, Will Clinger’s Larceny Scheme compiler, the Bigloo Scheme compiler, and probably many others. Why? Lots of people really like Scheme. Programs as data, good macro system, 35 years of development, big community. But … Read more