Home | History | Annotate | Download | only in BuildOptions 
      1 /*
      2  * [The "BSD license"]
      3  * Copyright (c) 2011 Terence Parr
      4  * All rights reserved.
      5  *
      6  * Conversion to C#:
      7  * Copyright (c) 2011 Sam Harwell, Pixel Mine, Inc.
      8  * All rights reserved.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. The name of the author may not be used to endorse or promote products
     19  *    derived from this software without specific prior written permission.
     20  *
     21  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     22  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     23  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     24  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     25  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     26  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     27  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     28  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     29  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     30  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     31  */
     32 
     33 grammar DebugGrammar;
     34 
     35 options
     36 {
     37 	language=CSharp3;
     38 	output=AST;
     39 	ASTLabelType=CommonTree;
     40 }
     41 
     42 tokens
     43 {
     44 	// define pseudo-operations
     45 	FUNC;
     46 	CALL;
     47 }
     48 
     49 @lexer::namespace{Antlr3.Runtime.Test.BuildOptions}
     50 @parser::namespace{Antlr3.Runtime.Test.BuildOptions}
     51 
     52 // START:stat
     53 prog: ( stat )*
     54     ;
     55 
     56 stat:   expr NEWLINE                    -> expr
     57     |   ID '=' expr NEWLINE             -> ^('=' ID expr)
     58     |   func NEWLINE                    -> func
     59     |   NEWLINE                         -> // ignore
     60     ;
     61 
     62 func:   ID  '(' formalPar ')' '=' expr  -> ^(FUNC ID formalPar expr)
     63     ;
     64 	finally {
     65 	  functionDefinitions.Add($func.tree);
     66 	}
     67 
     68 formalPar
     69     :   ID
     70 	|   INT
     71 	;
     72 
     73 // END:stat
     74 
     75 // START:expr
     76 expr:   multExpr (('+'^|'-'^) multExpr)*
     77     ;
     78 
     79 multExpr
     80     :   atom (('*'|'/'|'%')^ atom)*
     81     ;
     82 
     83 atom:   INT
     84     |   ID
     85     |   '(' expr ')'    -> expr
     86     |   ID '(' expr ')' -> ^(CALL ID expr)
     87     ;
     88 // END:expr
     89 
     90 // START:tokens
     91 ID  :   ('a'..'z'|'A'..'Z')+
     92 	;
     93 
     94 INT :   '0'..'9'+
     95     ;
     96 
     97 NEWLINE
     98     :	'\r'? '\n'
     99     ;
    100 
    101 WS  :   (' '|'\t')+ { Skip(); }
    102     ;
    103 // END:tokens
    104