Concept

Lexical analysis

Related lectures (24)

Covers the computation of 'nullable' and 'first' for regular expressions, converting expressions into a lexer, and handling token priorities.

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.

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.

Regular Expressions and Lexer Idea

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

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.

Words, tokens, n-grams and Language Models

Explores words, tokens, n-grams, and language models, focusing on probabilistic approaches for language identification and spelling error correction.

Name Analysis: Compiler Phases and Symbol Tables

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

Object-Oriented Parser Combinators

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

CLP Parser Lab Presentation

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

Tuples: Desugaring and Implementation

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

Introduction to Computer Language Processing

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

WS1S Solver: Project Structure

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

Multithreading: Code Generation and Type Checking

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

Stochastic Parsing: Probabilistic Approach

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

From Regular Expressions to Automata

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

Words Tokens: Lexical Level Overview

Explores words, tokens, and language models in NLP, covering challenges in defining them, lexicon usage, n-grams, and probability estimation.

Custom operators

Explores the implementation of custom operators in a programming language, including syntax examples, precedence levels, parsing stages, and solutions like function overloading.

Spelling Error Correction

Explores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.

Introduction to Natural Language Processing

Introduces the basics of Natural Language Processing, covering challenges, application domains, and linguistic processing levels.