Wiki**3
Menu
apresentação
Página Principal
Apresentação
Contactos
aulas
Compiladores
Programação com Objectos
Todas as Disciplinas...
investigação
Orientações
Publicações
Projectos
misc
Downloads
Community portal
Search
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Recent changes
Help
Log in
Theoretical Aspects of Lexical Analysis
From Wiki**3
Revision as of 01:01, 14 March 2008 by
Root
(
talk
|
contribs
)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Contents
1
Regular Expressions
2
Recognizing Regular Expressions
3
Building the NFA: Thompson's Algorithm
4
Building DFAs from NFAs
5
DFA Minimization
6
Input Processing
7
Recognizing Multiple Expressions
8
Example 1: Ambiguous Expressions
9
Example 2: Backtracking
Regular Expressions
Recognizing Regular Expressions
Building the NFA: Thompson's Algorithm
Building DFAs from NFAs
DFA Minimization
Input Processing
Recognizing Multiple Expressions
Example 1: Ambiguous Expressions
Example 2: Backtracking
Categories
:
Teaching
Compilers