Constructing a Lexer: First Symbols

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (21)

Page 1 of 3

Constructing a Lexer: First Symbols

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.