recursive descent parser

[gammaman]

anyone have an RDP program that can handle the following grammar?

<elist>  ->  <elist>,<e>|<e>      
<e>      ->   <n>^<e>|<n>
<n>     ->    <n><d>|<d>
<d>    ->    0|1|2|3|4|5|6|7|8|9

in case you were wondering, this grammar says that something like the following can be taken as an input string.

2^2^3,15,20^2

[darrylbu]

Posted all over the internet.
http://forums.sun.com/thread.jspa?threadID=5432690
http://www.dreamincode.net/forums/index.php?showtopic=163179
http://www.codeguru.com/forum/showthread.php?p=1925894
http://www.javaprogrammingforums.com/algorithms-recursion/3777-recursive-descent-parser.html
http://www.java-forums.org/advanced-java/26859-recursive-descent-parser.html

db

[darrylbu]

Now also on the Ranch as a thread hijack:
http://www.coderanch.com/t/487691/Java-General/java/Recursive-Descent-Parser

db

[helios]

Who tokenizes integers like that?