Understand Spooky-Completeness and String Scariness
masterSpookylang is 'Spooky-complete' (isomorphic to Turing completeness). It operates on a core invariant: it takes 'scary' input and produces 'spooky' output.
- Scariness: The compiler uses a hardcoded list of regular expressions to categorize strings as 'scary' or 'non-scary'.
- I/O Constraints: The compiler's I/O routines will crash if they are passed 'non-scary' strings.
- Variable Naming: Variable names must be 'scary' to satisfy the compiler.