Lecture
Regular Expressions and Lexer Idea
In course
DEMO: officia laborum
Eiusmod cupidatat reprehenderit enim occaecat incididunt enim aliqua sit aliqua. Voluptate fugiat aliquip sit esse. Deserunt consectetur in ex pariatur ullamco deserunt officia. Cupidatat velit anim pariatur ex cupidatat nulla aliquip.
Description
This lecture covers the concept of regular expressions, starting with defining languages using properties and regular expressions. It delves into the history of regular expressions, including the work of Stephen Cole Kleene. The lecture explains the different operators and operations involved in regular expressions, such as union, concatenation, and Kleene star. It also discusses lexical analysis, the construction of lexical analyzers using regular expressions, and the automation of this process. The lecture concludes with examples of manually constructing lexers and recognizing identifiers and keywords.
Instructor
ut et
Non amet do eu in. Aliqua sint Lorem anim aliquip eiusmod ex ut minim magna dolor consectetur adipisicing. Qui pariatur sint qui mollit nisi nulla nostrud aliqua. Labore fugiat reprehenderit exercitation consectetur do exercitation. Proident Lorem elit ut Lorem enim nisi qui pariatur irure adipisicing elit. Reprehenderit laboris culpa nulla quis.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related lectures (31)
Regular Expressions and Lexer Idea
Covers regular expressions, Kleene's contributions, logic, lexical analysis, and manual lexer construction.
Spelling Error Correction
Explores spelling error correction, including neologisms and borrowings, using edit distance and finite-state automata.
Regular Expressions (Recap)
Covers the fundamentals of regular expressions and includes exercises on defining languages.
WS1S Solver: Project Structure
Explores the project structure for solving WS1S formulas and planned additions.
Constructing a Lexer: First Symbols
Covers the computation of 'nullable' and 'first' for regular expressions.