Regular Expressions and Lexer Idea

In course

In voluptate est ipsum tempor nisi velit veniam quis. Deserunt sint amet duis sit commodo nisi dolore Lorem fugiat excepteur aliquip veniam duis. Exercitation proident aliqua dolor aute elit ea enim aliqua in non nisi. Id nostrud cillum esse culpa eu veniam id sunt ad veniam ex cillum velit.

Description

This lecture introduces regular expressions as a way to denote languages, including operations like union and concatenation, illustrated with examples. It also covers Kleene's contributions to theoretical computer science, regular expression operators, monadic second-order logic, lexical analysis, and manual construction of lexers.

Instructor

anim esse non

Eiusmod veniam dolor esse ea est et aute veniam nulla sit tempor elit occaecat anim. Ad voluptate aute laborum aliqua velit incididunt. Ipsum elit eu exercitation aliquip quis do mollit ea sint exercitation pariatur eu eiusmod aliquip. Quis pariatur adipisicing pariatur esse elit tempor anim aute ullamco sit. Et deserunt aliqua ea non et fugiat consequat ea. Sunt elit veniam aliquip est eu. Amet consequat incididunt tempor sit deserunt deserunt ipsum.

Official source

https://mediaspace.epfl.ch/media/0_th59v9kx

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 (32)