Algorithms

"Steve Vernon" <ACA99SRV@sheffield.ac.uk>
10 Apr 2002 00:20:48 -0400

          From comp.compilers
Related articles
Algorithms ACA99SRV@sheffield.ac.uk (Steve Vernon) (2002-04-10)
Re: Algorithms haberg@matematik.su.se (2002-04-13)
Re: Algorithms joachim_d@gmx.de (Joachim Durchholz) (2002-04-16)
Re: Algorithms rboland@unb.ca (Ralph Boland) (2002-04-17)
Re: Algorithms vmakarov@redhat.com (Vladimir Makarov) (2002-04-17)
Re: Algorithms joachim_d@gmx.de (Joachim Durchholz) (2002-04-19)
Re: Parsing Algorithms idbaxter@semdesigns.com (Ira D. Baxter) (2002-04-19)
[1 later articles]
| List of all articles for this month |
From: "Steve Vernon" <ACA99SRV@sheffield.ac.uk>
Newsgroups: comp.compilers
Date: 10 Apr 2002 00:20:48 -0400
Organization: Sheffield University
Keywords: parse, question
Posted-Date: 10 Apr 2002 00:20:47 EDT

Hiya,
        Working on a compiler compiler for my third year project, I am
experimenting with one that should handle any grammar by getting
combinations of the input tokens...


        If the tokens are say:


        [if,true,then,somecode,else,somecode]


        The algorithm (in Java hopefully) would return all combinations, given
the number of splits this rule has. So for example with 2 splits:


        [[ [if],[true,then,somecode,else,somecode] ] ,
[if,true],[somecode,else,somecode].........


        I have made one, but it is very slow for even small inputs.


        Does anyone have any ideas or knpow of any URL's that would be helpful.


        Thanks,


        Steve
        XX

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.