The Linguistic Theory Behind Blockly Languages
summary
Shows that Blockly’s block definitions map almost directly to dependency grammar: a one-to-one correspondence between dependency rules and Blockly JSON message strings, node types and connection check arrays, with an implemented generator that produces blocks from dependency grammars (not the reverse). Introduces EBNF-style sugar to collapse repeated alternatives and inline paired tokens so blocks gain multiple text fields and multiple connection entries. Outcome: generated Blockly toolboxes that reduce hundreds of hand-written JSON lines and make AST-level constraints explicit.
AI-written summary · about
chapters (13)
- 0:00Blockly languages intro
- 3:11Defining blocks in JSON
- 5:00Context-free grammar limits
- 8:38Dependency grammars fit better
- 11:29Dependency grammar roots
- 13:35Mathematical formalization
- 14:40Dependency grammar rules
- 16:29Mapping to Blockly blocks
- 18:18Syntactic sugar for grammars
- 21:35Q&A
- 24:44Dependency grammars as syntax
- 25:49Advantages over tree manipulation
- 26:30Closing remarks
related talks
42mBack to the Future
50mSyntaxation
45mHow to Make a Programming Language
50mCodex: The Impact of English on Programming Languages
46mGrammar a BNF like Ruby DSL Parsing
20mThe Lands Platform: Lan.guages and D.omain S.yntax
36mMythical trees and where to find them
06mVision: The Next 700 Language Workbenches