How to implement a graph-structured stack?

Posted by Emil on Stack Overflow See other posts from Stack Overflow or by Emil
Published on 2010-03-19T02:47:11Z Indexed on 2010/03/19 2:51 UTC
Read the original article Hit count: 163

Filed under:
|
|

Ok, so I would like to make a GLR parser generator. I know there exist such programs better than what I will probably make, but I am doing this for fun/learning so that's not important.

I have been reading about GLR parsing and I think I have a decent high level understanding of it now. But now it's time to get down to business.

The graph-structured stack (GSS) is the key data structure for use in GLR parsers. Conceptually I know how GSS works, but none of the sources I looked at so far explain how to implement GSS. I don't even have an authoritative list of operations to support. Can someone point me to some good sample code/tutorial for GSS? Google didn't help so far. I hope this question is not too vague.

© Stack Overflow or respective owner

Related posts about stack

Related posts about parser