Parsing with Combinators

Related lectures (32)

Page 1 of 4

Covers object-oriented parser combinators in Scala for building parsers, including JSON parsing and testing.

Covers implementing a parser for transforming tokens into an Abstract Syntax Tree.

Explores compiler phases and symbol tables' role in mapping variables to declarations.

Covers the implementation details of tuples in Scala, including desugaring, lexical analysis, parsing, and code generation.

Introduces the CYK parsing algorithm for context-free grammars, explaining its handling of ambiguity and importance in parsing general grammars.

Provides an overview of grammars and parsers in computer language processing.

Explores parsing general grammars using the CYK algorithm and Chomsky Normal Form.

Covers LL(1) parsing, formalization, automation, constraints, and parsing tables.

Covers multithreading, code generation, and type checking in compiler implementation.

Explores the project structure for solving WS1S formulas and planned additions.