Before writing this, I studied various papers about GLL, such as GLL Parsing <http://dotat.at/tmp/gll.pdf> and "Modelling GLL Parser Implementations". Also read the paper that described parser combinators of this kind and took a peek into djspiewak/gll-combinators that was written in scala.
I found the project written in scala very hard to read, and the papers weren't any much better. But I understood something about the description. I wrote a simple recognizer that appears to work. It prints out state transitions similar to what LR parser might go through with: https://gist.github.com/cheery/4b08ec93258e008ef7dd For someone who have actually understood the papers better, is my implementation even near of what GLL is? What is it if it's not?
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
