<--- Back to Details
First PageDocument Content
Computing / Nondeterministic finite automaton / Lexical analysis / Powerset construction / Deterministic finite automaton / Regular expression / Finite-state machine / Formal language / Regular language / Automata theory / Programming language implementation / Theoretical computer science
Date: 2008-09-08 16:58:22
Computing
Nondeterministic finite automaton
Lexical analysis
Powerset construction
Deterministic finite automaton
Regular expression
Finite-state machine
Formal language
Regular language
Automata theory
Programming language implementation
Theoretical computer science

Microsoft Word - 03-Lexical-Analysis.doc

Add to Reading List

Source URL: dragonbook.stanford.edu

Download Document from Source Website

File Size: 177,44 KB

Share Document on Facebook

Similar Documents

Perl regular expression puzzle: even zeros and odd ones Greg Bacon The challenge was to write a regular expression — subject to seemingly tight constraints: only literals, concatenation, Kleene star,

DocID: 1vc3D - View Document

Regular Expression Matching on Graphics Hardware for Intrusion Detection Giorgos Vasiliadis, Michalis Polychronakis, Spiros Antonatos, Sotiris Ioannidis, Evangelos P. Markatos FORTH-ICS, Greece

DocID: 1v8HL - View Document

Derivative-Based Diagnosis of Regular Expression Ambiguity Martin Sulzmann1 and Kenny Zhuo Ming Lu2 1 Karlsruhe University of Applied Sciences

DocID: 1tI80 - View Document

Fixing Regular Expression Matching Failure Martin Sulzmann1 and Kenny Zhuo Ming Lu2 1 Karlsruhe University of Applied Sciences

DocID: 1tFZR - View Document