rustlr 0.3.0

LR/LALR parser generator that can automatically create abstract syntax trees
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

public interface absLexer
{
   LexToken next(); // returns null at eof
   int linenum();
   // translator to particular grammar   
   LexToken translate_token(LexToken t);
}

public class LexToken
{
   public string token_type;
   public object token_value;
   public int line;      // lines start at 0
   public int column;    // columns start at 0
   public int position;  // absolute beginning character position (yychar)
   public LexToken(string t, object v) {token_type=t; token_value=v;}
   public LexToken(string t, object v, int l, int c)
   {token_type=t; token_value=v; line=l; column=c;}
   public LexToken(string t, object v, int l, int c, int p)
   {token_type=t; token_value=v; line=l; column=c; position=p;}      
   public override string ToString() {return token_type+"("+token_value+")";}
   public string complete_info()
   {
     return ("LexToken: type "+token_type+", value ("+token_value+"), type "+token_value.GetType()+", line "+line+", column "+column+", position "+position);
   }
}

/*
public class TerminalToken
{
  public string sym;  // must match terminal symbol name in grammar
  public object svalue;   // semantic value - cheap polymorphism
  public int line;
  public int column;
  public TerminalToken(string s, AT v, int l, int c)
  {sym=s; svalue=v; line=l; column=c;}
}
*/