amath/app/main/optimizer.h

62 lines
1.9 KiB
C++

/*
* Copyright (c) 2015-2016 Carsten Sonne Larsen
* 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.
*
*/
#ifndef _OPTIMIZER_H
#define _OPTIMIZER_H
/**
* @file optimizer.h
* @brief
*
*/
#include "main/nodes.h"
/**
* @brief
*
*/
class Optimizer {
public:
Optimizer(SyntaxNode *root);
~Optimizer();
void Optimize();
SyntaxNode* GetRoot();
int GetTreeDepth(SyntaxNode *node, int depth);
private:
SyntaxNode *root;
void TagChildren(SyntaxNode *node);
void BalanceTree(SyntaxNode *node);
void ReduceUnaryNodes(SyntaxNode *node);
void ReduceValueNodes(SyntaxNode *node);
void TagStartNode(SyntaxNode *node);
};
#endif