Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
WS1S Solver: Project Structure
Graph Chatbot
Related lectures (32)
Previous
Page 1 of 4
Next
From Regular Expressions to Automata
Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.
Parsing with Combinators
Explores parsing text into trees using parser combinators in Scala, covering filtering, transforming, sequencing, alternatives, recursion, spaces handling, lexing, monadic nature, and for-notation.
Finite Automata: Basics
Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.
CLP Parser Lab Presentation
Covers implementing a parser for transforming tokens into an Abstract Syntax Tree.
Object-Oriented Parser Combinators
Covers object-oriented parser combinators in Scala for building parsers, including JSON parsing and testing.
Regular Expressions (Recap)
Covers the fundamentals of regular expressions and includes exercises on defining languages.
Name Analysis: Compiler Phases and Symbol Tables
Explores compiler phases and symbol tables' role in mapping variables to declarations.
Grammars and Parsers: An Overview of Language Processing
Provides an overview of grammars and parsers in computer language processing.
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.
CYK Algorithm for Parsing General Grammars
Explores parsing general grammars using the CYK algorithm and Chomsky Normal Form.
