File: AST.cs

package info (click to toggle)
antlr 2.7.7%2Bdfsg-4
  • links: PTS, VCS
  • area: main
  • in suites: wheezy
  • size: 9,920 kB
  • sloc: java: 54,649; cs: 12,533; makefile: 8,963; cpp: 7,359; pascal: 5,273; sh: 4,337; python: 4,301; lisp: 1,969; xml: 220; lex: 192; ansic: 134
file content (89 lines) | stat: -rwxr-xr-x 2,361 bytes parent folder | download | duplicates (15)
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
using System;
using IEnumerator = System.Collections.IEnumerator;

using IToken = antlr.IToken;
	
namespace antlr.collections
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/// <summary>
	/// Minimal AST node interface used by ANTLR AST generation and tree-walker.
	/// </summary>
	public interface AST : ICloneable
	{
		/// <summary>
		/// Add a (rightmost) child to this node
		/// </summary>
		/// <param name="c"></param>
		void  addChild(AST c);
		bool Equals(AST t);
		bool EqualsList(AST t);
		bool EqualsListPartial(AST t);
		bool EqualsTree(AST t);
		bool EqualsTreePartial(AST t);
		IEnumerator findAll(AST tree);
		IEnumerator findAllPartial(AST subtree);
		/// <summary>
		/// Get the first child of this node; null if no children
		/// </summary>
		AST getFirstChild();
		/// <summary>
		/// Get	the next sibling in line after this one
		/// </summary>
		AST getNextSibling();
		/// <summary>
		/// Get the token text for this node
		/// </summary>
		/// <returns></returns>
		string getText();
		/// <summary>
		/// Get the token type for this node
		/// </summary>
		int Type	{ get; set;}
		/// <summary>
		/// Get number of children of this node; if leaf, returns 0
		/// </summary>
		/// <returns>Number of children</returns>
		int getNumberOfChildren();
		void  initialize(int t, string txt);
		void  initialize(AST t);
		void  initialize(IToken t);
		/// <summary>
		/// Set the first child of a node.
		/// </summary>
		/// <param name="c"></param>
		void  setFirstChild(AST c);
		/// <summary>
		/// Set the next sibling after this one.
		/// </summary>
		/// <param name="n"></param>
		void  setNextSibling(AST n);
		/// <summary>
		/// Set the token text for this node
		/// </summary>
		/// <param name="text"></param>
		void  setText(string text);
		/// <summary>
		/// Set the token type for this node
		/// </summary>
		/// <param name="ttype"></param>
		void  setType(int ttype);
		string ToString();
		string ToStringList();
		string ToStringTree();
	}
}