| AST::Assignment | = b; b *= c; c = d |
| ASTreeGrammar | |
| ASTreeGrammar::definition< ScannerT > | |
| AST::AttributeProxy | Attribute proxy allows some nicer ways to access the attributes then using set/get attributes Attribute proxy allows some nicer ways to access the attributes then using set/get attributes |
| AST::Constant | 5.0 |
| AST::Def_Array | Int x |
| AST::Def_Function | Function Declaration |
| AST::Def_Struct | Struct |
| AST::Def_Var | Int x |
| AST::FunctionCall | Func(x,y,z) |
| AST::Identifier | X |
| AST::If | Conditional -> If |
| AST::Jump | Break or continue |
| AST::Leaf | |
| AST::List | Special node type subclasses to contain a list of other nodes |
| AST::Loop | For or while or do while |
| AST::Node | Root node class, can save / load itself to its own file format, as well as be converted to 3ac subclasses declare the attributes they must have subclasses implement to3ac functionality |
| AST::Op_Binary | Binary operation -> + - < > .. |
| AST::Op_Bracket | A[5] |
| AST::Op_Dot | X.y |
| AST::Op_Ternary | A?b:c; |
| AST::Op_Unary | Unary Operation ++ -- * - sizeof |
| AST::Program | Root Program node |
| AST::Return | Return |
1.4.2-20050421