Parsing questions

My token list and node-class looks like this:
--------------------------------------------
typedef char *chr; //"Unlimited" strings


typedef struct{
      char token[toklen]; //toklen=30 or something. Ugly isn't it?
      int row;
}toktype;


toktyp t[1000]; //This is very ugly I know.


class Node{
      chr data;
      int code;
      Node *left,*right;
      Node(Node *l=0, Node *r=0, chr d=0, int cd=0) :
            left(l), right(r), data(d), code(cd) {}
};


----------------------------------------------------------


I have begun writing the parser as something like this:


----------------------------------------------------------


Node *parse(Node *root,int nr){
      switch(t[nr].token[0]){
      case '+' :
            root->data="PLUS"
            root->right=new Node(root->right,nr+2) // is this right??
....
....and so forth...


-------------
I don't know if I have got this right. However i would like some further
help on how to implement the parser for the binary tree-class???
Or should I use Recursive Descent or LALR or LL0 or LL1 or LR0 or LR1 ????
If so, how do I implement these????


Please help me!!!


Sincerely:


B. Rasmus Anthin
e8rasmus@etek.chalmers.se
www.etek.chalmers.se/~e8rasmus
57360731

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