Parsing lexical ambiguity with Elm and expressive types
summary
A Buffalo parser viewer implemented in Elm generates concrete parse trees and semantic results for any n > 0 and shows counts rising: 2→1, 3→3, 4→4, 5→7, 6→10, 7→15, 8→24, and explodes further by 12. It encodes meanings as a semantic value record, uses an expression application function to combine categories, and contrasts the Elm workflow with a JavaScript version. The app renders trees, supports emoji surface forms, the implementation works interactively, and the project surfaces insights about type-driven development.
AI-written summary · about
chapters (8)
- 0:00Start
- 1:30Chomsky Grammars
- 3:20Buffalo Sentence
- 5:05Wh Reduction
- 12:17Primary Types
- 14:31Lessons Learned
- 16:17Transitive Verb
- 16:30Type Aliases
related talks
53mAdventures in Elm: Events, Reproducibility, and Kindness
41mMonadic Parsers at the Input Boundary
44mMy adventure with Elm
51mElm-Friendly Functional Programming For The Web
26mDeveloping with Elm in a large application
39mHands-On Intro to Bidirectional Type Inference with Elm
01h 28mFunctional Programming for the Web with Elm
47mElm or how I learned to love front end development