Parsing Parsers
summary
Builds a small search-query parser in JavaScript that actually tokenizes with regular expressions, wraps lexemes into tokens, and produces a navigable parse tree used to drive a visualizer. Regular-expression lexing works for the initial regular-grammar (terms, phrases, simple filters) but breaks when filters split into modifier+entity, so parser logic steps in to implement a context-free grammar production and the resulting parser and UI demonstrator run and produce the expected trees.
AI-written summary · about
chapters (6)
- 0:00Start
- 2:18the abcs of language
- 5:17syntax city
- 7:03moving parse
- 12:42parse for the course
- 22:46real world: parsers
related talks
58mGoodbye Regex. Hello Parsers!
29mMy Little Parser: Tooling is Magic
29mReimplement RegExp in JavaScript
41mParsers Are Sparta
17mSyntactic Code Search with Sequence-to-Tree Matching: Supporting Syntactic Search with(…)
31mAdvanced JavaScript code search: Abstract Syntax Tree analysis
27mParsing, Compiling, and Static Metaprogramming
25mFormal Verification for JavaScript Regular Expressions: A Proven Mechanized Semantics(…)