<--- 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

Hilbert II Presentation of Formal Correct Mathematical Knowledge Logical Language Michael Meyling

DocID: 1uiJW - View Document

Formal Issues in Natural Language Generation Kees van Deemter *, Ehud Reiter *, and Helmut Horacek † (*) Dept. of Computing Science, University of Aberdeen, UK (†) Universit¨at des Saarlandes, Saarbr¨ucken, Germany

DocID: 1tOUt - View Document

Towards a Formal Language for Electronic Contracts Gerardo Schneider gerardo@i.uio.no Joint work with Cristian Prisacariu (cristi@i.uio.no)

DocID: 1tJEf - View Document

Fabienne Martin, Dennis Spohr, Achim Stein Representing a Resource of Formal Lexical-Semantic Descriptions in the Web Ontology Language This paper presents an approach to disambiguating verb senses which

DocID: 1tqt7 - View Document

A formal account of WS-BPEL? Alessandro Lapadula, Rosario Pugliese and Francesco Tiezzi Dipartimento di Sistemi e Informatica Universit`a degli Studi di Firenze Abstract. We introduce Blite, a lightweight language for we

DocID: 1t7C9 - View Document