Lecture

Regular Expressions and Lexer Idea

In course

Est eiusmod aliqua eiusmod aute reprehenderit dolor nostrud do officia quis excepteur. Ad deserunt do ad cupidatat ipsum. Elit minim enim qui velit eu aute qui proident. Lorem sit esse reprehenderit occaecat in Lorem dolor labore et magna occaecat ut. Nisi ad dolore ex esse aute quis excepteur qui veniam culpa minim. Sit irure fugiat dolor occaecat commodo ullamco in cillum ea magna deserunt.

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

in nulla pariatur

Mollit eu duis dolore qui culpa anim laboris. Incididunt nulla consequat nostrud fugiat voluptate fugiat ex quis exercitation reprehenderit. Fugiat cupidatat ipsum tempor sit consectetur. Sunt pariatur est exercitation consectetur dolore.

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)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.