Age | Commit message (Collapse) | Author |
|
* member method "addNode" of "Tree" was relieved of its uneccessary "place" argument
* again contified where possible
** e.g. the "buildTree" local element vectors for storing the lexer result
|
|
* as with all Node classes the public member methods of the "Tree" class do not need to be non-const
* both constructors are more easily expressed as aliases of a single constructor that takes both the term and a pointer to a constant map instance
* the tree is now constructed during member initialization
|
|
* now using range for-loops during Tree printing
* inroduced popNode helper method which helps to simplify the Tree construction implementation
|
|
|
|
* SimpleParser optionally acceps a pointer to an ConstantMap containing string keys mapping to values
* Constants are handled in their own ConstantNode class derived from the standard Node class
* Operator precedence is now determined separated from the TokenType using a new PrecedenceLevel enum
** Conversion between tokens and their PrecedenceLevel is possible using the new utility function getPrecedence
* Added additional test cases for constant identifier resolutions
|
|
Added ConstantNode blueprint
|
|
* OperatorNode class now uses TokenType for internal operator storage and logic selection
* print-Method resolves the TokenType back into its character representation
|
|
* New priority for alphabetic characters
* Overloaded OperandNode constructor
* Currently not usable, only basic proof of concept
|
|
* Enabled tree to generate itself
** Main work is now done during tree construction
* Moved lexer and getPriority utility functions into separate compilation unit
|
|
|
|
|