• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1/*
2 * [The "BSD licence"]
3 * Copyright (c) 2005-2008 Terence Parr
4 * All rights reserved.
5 *
6 * Conversion to C#:
7 * Copyright (c) 2008-2009 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
33tree grammar ProfileTreeGrammar;
34
35options
36{
37	language=CSharp3;
38	tokenVocab=ProfileGrammar;
39	ASTLabelType=CommonTree;
40}
41
42// START:members
43@header
44{
45//import java.util.Map;
46//import java.util.HashMap;
47using BigInteger = java.math.BigInteger;
48using Console = System.Console;
49}
50// END:members
51
52// START:rules
53prog:   stat*
54    ;
55
56stat:   expr                       { string result = $expr.value.ToString();
57                                     Console.Out.WriteLine($expr.value + " (about " + result[0] + "*10^" + (result.Length-1) + ")");
58                                   }
59    |   ^('=' ID expr)             { globalMemory[$ID.text] = $expr.value; }
60    |   ^(FUNC .+)	               // ignore FUNCs - we added them to functionDefinitions already in parser.
61    ;
62
63expr returns [BigInteger value]
64    :   ^('+' a=expr b=expr)       { $value = $a.value.add($b.value); }
65    |   ^('-' a=expr b=expr)       { $value = $a.value.subtract($b.value); }
66    |   ^('*' a=expr b=expr)       { $value = $a.value.multiply($b.value); }
67    |   ^('/' a=expr b=expr)       { $value = $a.value.divide($b.value); }
68    |   ^('%' a=expr b=expr)       { $value = $a.value.remainder($b.value); }
69    |   ID                         { $value = getValue($ID.text); }
70    |   INT                        { $value = new BigInteger($INT.text); }
71    |   call                       { $value = $call.value; }
72    ;
73
74call returns [BigInteger value]
75    :   ^(CALL ID expr)            { BigInteger p = $expr.value;
76                                     CommonTree funcRoot = findFunction($ID.text, p);
77                                     if (funcRoot == null) {
78                                         Console.Error.WriteLine("No match found for " + $ID.text + "(" + p + ")");
79                                     } else {
80                                         // Here we set up the local evaluator to run over the
81                                         // function definition with the parameter value.
82                                         // This re-reads a sub-AST of our input AST!
83                                         ProfileTreeGrammar e = new ProfileTreeGrammar(funcRoot, functionDefinitions, globalMemory, p);
84                                         $value = e.expr();
85                                     }
86                                   }
87    ;
88// END:rules
89