usage of a stack in the eps-closure algorithm

"Eli Bendersky" <>
3 Sep 2004 12:41:47 -0400

          From comp.compilers

Related articles
usage of a stack in the eps-closure algorithm (Eli Bendersky) (2004-09-03)
| List of all articles for this month |

From: "Eli Bendersky" <>
Newsgroups: comp.compilers
Date: 3 Sep 2004 12:41:47 -0400
Keywords: question
Posted-Date: 03 Sep 2004 12:41:47 EDT

Hi all,

I'm referring to the E-closure algorithm for subset construction
(Dragon book Fig 3.26).

A stack is used to hold states whose edges have not been checked for
epsilon transitions. Is a stack necessary for this algorithm ? Wouldn't
a queue work here too ?

I don't have anything personal against stacks, I'm just curious...
Thanks in advance

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.