On 22.03.13 01:49, Thomas Ingram wrote: > I am working on a new programming language > (https://github.com/rip-lang/rip/tree/take-two), and I'm having trouble > getting to the bottom of some infinite loops. Is there a way to print > out each rule as it gets called, such that I can see the rules that are > recursing? I've tried walking through the code in my head, and I just > don't see it. Any help would be much appreciated. Thank you and thank > you so much for Parslet! Hei Thomas,
Help us help you: post an instance of a problem that goes StackError and we'll be surely able to figure out why. Then lather, rinse, repeat :) kaspar
