In order to try to implement a PEG in JavaScript that doesn't make older browsers crash from stack overflows, I would like to make a parsing expression grammar that parses a string in a non-recursive way. How do you do this? It feels mind bending.In order to try to implement a PEG in JavaScrip
阅读背景：
如何使用非递归堆栈来编写递归函数?
来源：互联网
分享到：
