|usage of a stack in the eps-closure algorithm firstname.lastname@example.org (Eli Bendersky) (2004-09-03)|
|From:||"Eli Bendersky" <email@example.com>|
|Date:||3 Sep 2004 12:41:47 -0400|
|Posted-Date:||03 Sep 2004 12:41:47 EDT|
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
Return to the
Search the comp.compilers archives again.