Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include "ExactSubtreeMatchingAutomaton.h"
#include <tree/properties/SubtreeJumpTable.h>
#include <tree/ranked/RankedTree.h>
#include <tree/ranked/RankedPattern.h>
#include <tree/ranked/UnorderedRankedTree.h>
#include <tree/ranked/UnorderedRankedPattern.h>
#include <tree/ranked/PrefixRankedTree.h>
#include <tree/ranked/PrefixRankedPattern.h>
#include <tree/ranked/PrefixRankedBarTree.h>
#include <tree/ranked/PrefixRankedBarPattern.h>
#include <tree/unranked/UnrankedPattern.h>
#include <tree/unranked/UnrankedExtendedPattern.h>
#include <automaton/PDA/InputDrivenNPDA.h>
#include <automaton/PDA/VisiblyPushdownNPDA.h>
#include <automaton/PDA/NPDA.h>
#include <automaton/TA/NFTA.h>
#include <automaton/TA/UnorderedNFTA.h>
#include <automaton/TA/NondeterministicZAutomaton.h>
#include <common/ranked_symbol.hpp>
#include <alphabet/BottomOfTheStackSymbol.h>
Go to the source code of this file.
Data Structures | |
class | arbology::exact::ExactPatternMatchingAutomaton |
Namespaces | |
namespace | arbology |
namespace | arbology::exact |
Functions | |
template<class SymbolType > | |
ext::vector< char > | arbology::exact::computeRHS (const tree::PrefixRankedPattern< SymbolType > &pattern, const ext::vector< int > &patternSubtreeJumpTable, int i) |
template<class SymbolType > | |
unsigned | arbology::exact::constructRecursivePattern (const ext::tree< common::ranked_symbol< SymbolType > > &node, automaton::NFTA< SymbolType, unsigned > &res, const common::ranked_symbol< SymbolType > &subtreeWildcard, unsigned &nextState) |
template<class SymbolType > | |
unsigned | arbology::exact::constructRecursivePattern (const ext::tree< common::ranked_symbol< SymbolType > > &node, automaton::UnorderedNFTA< SymbolType, unsigned > &res, const common::ranked_symbol< SymbolType > &subtreeWildcard, unsigned &nextState) |
template<class SymbolType > | |
unsigned | arbology::exact::constructRecursivePattern (const ext::tree< SymbolType > &node, automaton::NondeterministicZAutomaton< SymbolType, unsigned > &res, const SymbolType &subtreeWildcard, const SymbolType &subtreeGap, const SymbolType &nodeWildcard, unsigned &nextState) |