B1) PCFG
Discover **Probabilistic Context-Free Grammars (PCFG)**: assign probabilities to rules to generate varied, controlled music or text. Essential for BP3!
Discover **Probabilistic Context-Free Grammars (PCFG)**: assign probabilities to rules to generate varied, controlled music or text. Essential for BP3!
Discover the 7 BP3 derivation modes and how these strategies transform a grammar into a dynamic and expressive musical generator. Master musical generation.
Explore the full BPscript pipeline: JS compiler, WebAssembly engine, resolver, and dispatcher. From .bp file to sound, its complete anatomy is detailed.
Discover 20+ formal music languages, from Csound to TidalCycles. Genealogy, comparative table, and BP3’s unique position. An essential guide!
Discover the complexity matrix, revealing the differential coupling between generation and parsing. Understand why their asymmetry isn’t just O(n) vs O(n³).
Reversible grammars are 50 years old. Why isn’t bidirectionality adopted? This article explores the structural reasons for this persistent asymmetry.
Generation-parsing asymmetry is mathematical. Discover key formulas: O(n) complexity, Catalan numbers, surprisal. Understand its 6 fundamental dimensions.
Generation is always top-down. But parsing (LL, LR) has unique directional freedom. Discover this fundamental asymmetry, essential for compilers.
Explore the duality of grammars: generation vs. recognition. Why is producing easier than analyzing? Discover this key asymmetry in linguistics and music.
Classical semantics have limits. Explore advanced semantics: translational, process, and algebraic. Understand compilers, concurrent systems, and data types.