Constructing a Lexer: First Symbols

In course

Nulla duis fugiat consequat labore nulla laboris adipisicing velit do. Ullamco reprehenderit consectetur sunt et anim. Proident laborum mollit id minim. Ullamco eiusmod minim magna aliqua reprehenderit officia.

Description

This lecture covers the computation of 'nullable' and 'first' for regular expressions, clarifying the process with examples. It also delves into converting simple regular expressions into a lexer, handling white spaces, comments, and token priorities.

Instructor

nisi incididunt sint

Non nisi qui magna nostrud. Esse id labore nisi mollit. Quis ad laboris cillum proident. Laboris consequat sit sint et ullamco cillum labore duis dolor ad culpa et anim.

Official source

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

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)