An algebraic data type is a type defined via constructors that can subsequently – often in a functional language setting – be used in pattern matching. The typical example is (using Haskell syntax):
PLAIN TEXT
HASKELL:
data IntStack = Empty | Cons Int IntStack
One can view the type constructors (Cons and Empty above) as regular functions acting on [...]
Are you not tired of writing those boring for loops, repeating virtually the same boiler plate “finder” or “accumulator” code over and over again? Are you also too afraid of those academic languages or simply enjoy actually getting paid for what you do, i.e., you are confined to Java?
Well, I assume there are tons of [...]
Parsing code is hard, and strictly limited to The Chosen Few. Right? No, wrong!
I know you are aware of some compiler compilers or parser generators out there – i.e., frameworks that let you specify annotated grammar descriptions, often using a BNF (Backus Naur Form) kind of syntax. The most famous parser generator is Yacc, which [...]