You've created an infinitely recursing grammar. SimpleParse is a
straightforward recursive descent parser without look-ahead (unless
explicitly coded) or ambiguity resolution. You are asking it to parse
expr to see if expr,binop,expr is matched. It will continue
recursing down into
Laszlo Nagy wrote:
...
Is there any way I can specify precedence tables? Or do I have to use
a different parser generator then?
You normally specify them as
top_precedence/second_precedence/last_precedence sets. SimpleParse'
limitation is with ambiguity, not with precedence. SimpleParse
The program below gives me segmentation fault (core dumped).
Environment:
Linux gandalf-desktop 2.6.20-16-generic #2 SMP Tue Feb 12 05:41:34
UTC 2008 i686 GNU/Linux
Python 2.5.1
What is wrong with my grammar? Can it be an internal error in simpleparse?
Thanks,
Laszlo
from
Laszlo Nagy wrote:
The program below gives me segmentation fault (core dumped).
Environment:
Linux gandalf-desktop 2.6.20-16-generic #2 SMP Tue Feb 12 05:41:34
UTC 2008 i686 GNU/Linux
Python 2.5.1
What is wrong with my grammar? Can it be an internal error in simpleparse?
There's
Laszlo Nagy wrote:
The program below gives me segmentation fault (core dumped).
Environment:
Linux gandalf-desktop 2.6.20-16-generic #2 SMP Tue Feb 12 05:41:34
UTC 2008 i686 GNU/Linux
Python 2.5.1
What is wrong with my grammar? Can it be an internal error in simpleparse?
You've
