The Interpreter: The Grammar Forge
Given a language, define a representation for its grammar along with an interpreter.
✧ GANG OF FOUR LINEAGE & ARCANUM ✧
GOF DESIGN PATTERN: Interpreter
ARCANUM SCHOOL: Divination // Rune-Parsing
SCRIBE / ARCHON: Joshua Edward McLaughlin Cox
CANONICAL REGISTRATION:
// ALLOY PATTERN //
abstract sig Rune {
power: one Int
}
sig BaseRune extends Rune {}
sig CompoundRune extends Rune {
left, right: one Rune
}
{
power = plus[left.power, right.power]
}
fact "Runes Shall Not Consume Themselves" {
no r: CompoundRune | r in r.^(left + right)
}
run {} for 4 but 4 Int
The Interpreter: The Grammar Forge
Parsing the ancient scripts requires a recursive grammar tree. CompoundRune nodes aggregate their power from their left and right children using Alloy’s built-in plus operator. The model guarantees syntactic validity by preventing self-referential cycles within the Abstract Syntax Tree.
Runic Tags:
#behavioral
#interpreter
#parsing