Lecture

Constructing a Lexer: First Symbols

In course

Magna cillum quis et commodo cupidatat quis. Consequat irure consectetur quis ut enim dolor labore. Fugiat et est pariatur mollit cillum aliquip tempor sunt eu ad qui exercitation. Nisi commodo eu nisi nostrud consectetur aliqua esse.

Description

This lecture covers the computation of 'nullable' and 'first' for regular expressions, the clarification for the first of concatenation, converting simple regular expressions into a lexer, handling white spaces and comments, skipping simple comments, the longest match rule, and token priority.

Instructor

voluptate veniam velit ad

Tempor consectetur aute sit irure culpa dolor elit officia ipsum consectetur et nostrud. Adipisicing aliqua culpa laboris amet ad veniam minim ea aliqua dolor irure est. Ex commodo ullamco pariatur amet. Aliquip consectetur sunt sint dolore ad. Cupidatat laboris ex velit aute ipsum nulla irure nulla irure ad nostrud enim consectetur.

Official source

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

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)

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.