() 康桥 <usakq12...@gmail.com> () Fri, 06 Dec 2013 18:30:16 +0800 But I still leave one function not understand. It's function digraph in the macro lalr-parser in file lalr.scm. It seems that this function is trying to traverse a digraph and make each FOLLOW set corresponding a vertex in the digraph the union of it and the FOLLOW sets corrsponding the vertices which can be reached from the vectex I mentioned before. But I can't figure out what algorithm it uses.
Anyone who know this algorithm?
At first glance it seems to be a standard fanout computation.
What do you mean by "know"? Are you looking for its name?
BTW, should we rewrite lalr-scm in a more scheme way(even to
make the process of parser generating slower)?
Why don't you go ahead and try, then post your findings?
--
Thien-Thi Nguyen
GPG key: 4C807502
(if you're human and you know it)
read my lisp: (responsep (questions 'technical)
(not (via 'mailing-list)))
=> nil
signature.asc
Description: PGP signature
