Reading 19: Parsers
A parser generator is a good tool that you should make part of your toolbox. A parser generator takes a grammar as input and automatically generates a parser, which takes a sequence of characters and tries to match the sequence against the grammar.
Reading 19: Parsers Reading 19: Parsers Software in 6.031 Safe from bugs Easy to understand Ready for change Correct today and correct in the unknown future. Communicating clearly with future programmers, including future you. Designed to accommodate change without rewriting. Objectives After today’s class, you should: Be able to use a grammar in combination with a parser generator, to parse a character sequence into a parse tree Be able to convert a parse tree into a useful data type Parser generators A parser generator is a good tool that you should make part of your toolbox. A parser genera
related reading
- Reading 12: Regular Expressions & Grammarsweb.mit.edu
- Parsing Expressions · Crafting Interpreterscraftinginterpreters.com
- CS [45]12[01] Spring 2023courses.cs.cornell.edu
- Scanning · Crafting Interpreterscraftinginterpreters.com
- Laurence Tratt: Which Parsing Approach?tratt.net
- Reading 18: Regular Expressions & Grammarsweb.mit.edu
- 2. Kaleidoscope: Implementing a Parser and AST — LLVM 23.0.0git documentationllvm.org
- Reading 19: Little Languagesweb.mit.edu
- The ANTLR Mega Tutorialtomassetti.me
- Chris's Wiki :: blog/programming/WhyRDParsersForMeutcc.utoronto.ca
- Context-free grammar - Wikipediaen.wikipedia.org
- Representing Code · Crafting Interpreterscraftinginterpreters.com