Lecture

Constructing a Lexer: First Symbols

Related lectures (21)

Covers the computation of 'nullable' and 'first' for regular expressions.

Regular Expressions and Lexer Idea

Explores regular expressions, including their history, operators, lexical analysis, and manual construction of lexers.

Regular Expressions and Lexer Idea

Covers regular expressions, Kleene's contributions, logic, lexical analysis, and manual lexer construction.

Static Analysis for Amy: Introduction to AST-based Analysis

Introduces AST-based analysis and its benefits over testing, covering its applications, rule implementations, and limitations.

From Regular Expressions to Automata

Explores the transition from regular expressions to finite automata, covering lexer creation, different automata types, and conversion processes.

WS1S Solver: Project Structure

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

CLP Parser Lab Presentation

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

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.

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.

Regular Expressions (Recap)

Covers the fundamentals of regular expressions and includes exercises on defining languages.

Problems and Languages: Regular Languages

Covers regular languages, encoding, alphabets, words, languages, concatenation, exponentiation, and iterative closure.

Automata Theory: Basics and Theorems

Introduces the basics of automata theory and explores the theorems of regular languages.

Finite Automata: Basics

Introduces the basics of finite automata, including deterministic and non-deterministic types, regular expressions, and acceptance criteria.

Grammars and Parsers: An Overview of Language Processing

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

Regular Expressions to Automata

Explores the conversion of regular expressions to automata for efficient character classification.

Introduction to Computer Language Processing

Covers computer language processing, compilers, skills learned, and application examples.

Regular Expressions: Basics and Applications

Introduces regular expressions, covering language sets, syntax, semantics, and limitations.

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.

Introduction to Grammars

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