It would be intersting to follow. I was thinking of a parser in J. There is the sequential machine, but without some kind of regex definition front end, it's not very useful. However, it's possible to make a tokenizer based on regex itself. Then LL(1) parser can be written by hand. Though it would be good to have a J generator for some good parsers, such as a nice simple Coco/R.
--- Devon McCormick <[EMAIL PROTECTED]> wrote: > Does anyone have any code to parse C# (ASP.NET) code? > I'm interested in building a simple calling tree. I have APL code to parse > C but would probably re-do it from scratch in J if I have to. > > Thanks, > > Devon > -- > Devon McCormick > ^me^ at acm. > org is my > preferred e-mail > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
