mirror of https://gitlab.com/rnger/amath
59 lines
2.0 KiB
C++
59 lines
2.0 KiB
C++
/*-
|
|
* Copyright (c) 2014-2021 Carsten Sonne Larsen <cs@innolan.net>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* Project homepage:
|
|
* https://amath.innolan.net
|
|
*
|
|
*/
|
|
|
|
#ifndef AMATH_OPTIMIZER_H
|
|
#define AMATH_OPTIMIZER_H
|
|
|
|
#include "main/nodes.h"
|
|
|
|
/**
|
|
* @brief
|
|
*
|
|
*/
|
|
class Optimizer
|
|
{
|
|
public:
|
|
explicit Optimizer(SyntaxNode* root);
|
|
~Optimizer();
|
|
|
|
void Optimize() const;
|
|
SyntaxNode* GetRoot() const;
|
|
static int GetTreeDepth(SyntaxNode* node, int depth);
|
|
|
|
private:
|
|
SyntaxNode* root;
|
|
static void TagChildren(SyntaxNode* node);
|
|
static void BalanceTree(SyntaxNode* node);
|
|
static void ReduceUnaryNodes(SyntaxNode* node);
|
|
static void ReduceValueNodes(SyntaxNode* node);
|
|
static void TagStartNode(SyntaxNode* node);
|
|
};
|
|
|
|
#endif
|