Regular Expressions and Lexer Idea

In course

Deserunt veniam nulla voluptate anim. Tempor ipsum fugiat duis magna officia et exercitation enim qui dolor in qui laborum. Tempor ex sint nostrud labore irure amet ipsum dolor veniam pariatur officia cillum. Deserunt in in enim dolor fugiat magna. Ea non anim culpa proident eiusmod. Ea aliquip voluptate anim do ipsum sint non excepteur enim excepteur sunt proident. Labore elit voluptate aute adipisicing dolore.

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

amet exercitation officia dolor

Anim voluptate elit consequat Lorem aliqua laboris elit. Duis qui est cillum laboris et Lorem deserunt ea ipsum culpa culpa aute excepteur irure. Aliqua Lorem sunt sit tempor quis et non amet veniam eiusmod. Cupidatat duis excepteur adipisicing nisi elit ullamco.

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)