November 2012
Intermediate to advanced
381 pages
13h 26m
English
book
Introduction to Compiler Construction in a Java World
by Bill Campbell, Swami Iyer, Bahar Akbal-Delibas
Content preview from Introduction to Compiler Construction in a Java World
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Lexical Analysis 49
Algorithm 2.3 NFA to DFA Construction
Input: an NFA, N = (Σ, S, s
0
, M, F )
Output: DFA, D = (Σ, S
D
, s
D0
, M
D
, F
D
)
Set S
D0
← -closure(s
0
)
Set S
D
.add(S
D0
)
Moves M
D
Stack stk.push(S
D0
)
i ← 0
while ! stk.empty() do
t ← stk.pop()
for a in Σ do
S
Di+1
← -closure(m(t, a));
if S
Di+1
6= {} then
if S
Di+1
∈ S
D
then
// We have a new state
S
D
.add(S
Di+1
)
stk.push(S
Di+1
)
i ← i + 1
M
D
.add(M
D
(t, a) = i)
else if ∃j, S
j
∈ S
D
∧ S
Di+1
= S
j
then
// In the case that the state already exists
M
D
.add(M
D
(t, a) = j)
end if
end if
end for
end while
Set F
D
for s
D
in S
D
do
for s in s
D
do
if s ∈ F then
F
D
.add(s
D
)
end if
end for
end for
return D = (Σ, S
D
, s
D0
, M
D
, F
D
)
FIGURE 2.17 An initial partition ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.