Lecture

CLP Parser Lab Presentation

Related lectures (32)

Explores parsing text into trees using parser combinators in Scala, covering filtering, transforming, sequencing, alternatives, recursion, spaces handling, lexing, monadic nature, and for-notation.

Object-Oriented Parser Combinators

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

Grammars and Parsers: An Overview of Language Processing

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

Syntax Trees: Parse vs AST

Explains syntax trees, parse vs AST, while language syntax, AST classes, and grammar ambiguities.

Parsing: CYK Algorithm

Explores formal grammars, parsing algorithms, CYK algorithm efficiency, and syntactic correctness in Natural Language Processing.

CYK Algorithm for Parsing General Grammars

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

CYK Parsing Algorithm for General Grammars

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

LL(1) Parsing

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

WS1S Solver: Project Structure

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

Syntactic Parsing and Graph2Graph Transformers

Covers syntactic parsing, dependency grammar, and graph-based neural network parsing.

CYK algorithm

Introduces the CYK algorithm for efficient syntactic analysis using chart parsing and discusses its complexity and bottom-up parsing technique.

Name Analysis: Compiler Phases and Symbol Tables

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

Tuples: Desugaring and Implementation

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

Multithreading: Code Generation and Type Checking

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

Introduction to Grammars

Introduces automata, regular languages limitations, context-free grammars, and balanced parentheses grammars.

Stochastic Parsing: Probabilistic Approach

Covers Stochastic Context-Free Grammars, probabilistic parsing, and the estimation of probabilities.

Foundations of Software: Modeling Programming Languages

Covers the mathematical study of program behaviors, parsing, domain-specific languages, and powerful tools for language design.

Scallion tutorial: building Parser[A]

Covers the basics of building Parser[A] using Scallion, LL(1) conflicts, and left factoring.

Compilers: Challenges with Digital Signal Processors

Covers the challenges of compiling for digital signal processors due to their unique architectural features and irregularities.

Context-Free Grammars: Part 1

Covers context-free grammars, production rules, automata, syntax analysis, and parsing techniques.