Logo Search packages:      
Sourcecode: maude version File versions  Download package

Public Types | Public Member Functions | Protected Member Functions | Static Protected Attributes | Private Attributes

StringSymbol Class Reference

Inheritance diagram for StringSymbol:
Inheritance graph
[legend]
Collaboration diagram for StringSymbol:
Collaboration graph
[legend]

List of all members.

Public Types

enum  CtorStatus { IS_CTOR = 1, IS_NON_CTOR = 2, IS_COMPLEX = IS_CTOR | IS_NON_CTOR }
typedef Vector< int > SourceSet

Public Member Functions

void addOpDeclaration (const Vector< Sort * > &domainAndRange, bool constructorFlag)
int arity () const
virtual bool attachData (const Vector< Sort * > &opDeclaration, const char *purpose, const Vector< const char * > &data)
virtual bool attachSymbol (const char *purpose, Symbol *symbol)
virtual bool attachTerm (const char *purpose, Term *term)
virtual bool canProduceErrorSort () const
virtual bool canResolveTheoryClash ()
int compare (const Symbol *other) const
virtual void compileEquations ()
void compileOpDeclarations ()
virtual void compileRules ()
virtual void compileSortConstraints ()
void computeBaseSort (DagNode *subject)
virtual void computeGeneralizedSort (const SortBdds &sortBdds, const Vector< int > &realToBdd, DagNode *subject, Vector< Bdd > &generalizedSort)
void computePossibleDomainSorts (const NatSet &rangeSorts, Vector< NatSet > &domainSorts)
virtual void computeSortFunctionBdds (const SortBdds &sortBdds, Vector< Bdd > &sortFunctionBdds) const
void constrainToExactSort (DagNode *subject, RewritingContext &context)
void constrainToSmallerSort (DagNode *subject, RewritingContext &context)
virtual void copyAttachments (Symbol *original, SymbolMap *map)
const ConnectedComponentdomainComponent (int argNr) const
virtual bool domainSortAlwaysLeqThan (Sort *sort, int argNr)
bool eagerArgument (int argNr) const
bool eqRewrite (DagNode *subject, RewritingContext &context)
bool equationFree () const
bool evaluatedArgument (int argNr) const
void fastComputeTrueSort (DagNode *subject, RewritingContext &context)
void fillInSortInfo (Term *subject)
void finalizeSortInfo ()
int getCtorStatus () const
virtual void getDataAttachments (const Vector< Sort * > &opDeclaration, Vector< const char * > &purposes, Vector< Vector< const char * > > &data)
const Vector< Equation * > & getEquations () const
const NatSetgetFrozen () const
unsigned int getHashValue ()
int getIndexWithinModule () const
int getLineNumber () const
const NatSetgetMaximalOpDeclSet (Sort *target)
ModulegetModule () const
const Vector< OpDeclaration > & getOpDeclarations () const
const Vector< Rule * > & getRules () const
SortgetSingleNonErrorSort () const
const Vector< SortConstraint * > & getSortConstraints () const
const Vector< int > & getStrategy () const
virtual void getSymbolAttachments (Vector< const char * > &purposes, Vector< Symbol * > &symbols)
virtual void getTermAttachments (Vector< const char * > &purposes, Vector< Term * > &terms)
int getUniqueSortIndex ()
bool hasFrozenArguments () const
int id () const
virtual bool interSymbolPass ()
bool isConstructor (DagNode *subject)
bool isMemoized () const
bool isStable () const
bool kindLevelDeclarationsOnly () const
DagNodemakeCanonical (DagNode *original, HashConsSet *)
DagNodemakeCanonicalCopy (DagNode *original, HashConsSet *)
DagNodemakeDagNode (const Vector< DagNode * > &args)
TermmakeTerm (const Vector< Term * > &args)
virtual UnificationSubproblemmakeUnificationSubproblem ()
void memoEnter (SourceSet &sourceSet, DagNode *destination)
bool memoRewrite (SourceSet &sourceSet, DagNode *subject, RewritingContext &context)
bool mightMatchPattern (Term *pattern)
void normalizeAndComputeTrueSort (DagNode *subject, RewritingContext &context)
void offerEquation (Equation *equation)
void offerRule (Rule *rule)
void offerSortConstraint (SortConstraint *sortConstraint)
void orderSortConstraints ()
virtual void postInterSymbolPass ()
virtual void postOpDeclarationPass ()
ConnectedComponentrangeComponent () const
virtual bool rangeSortAlwaysLeqThan (Sort *sort)
virtual bool rangeSortNeverLeqThan (Sort *sort)
virtual void reset ()
virtual void resetRules ()
virtual void restoreHiddenState ()
bool ruleFree () const
virtual DagNoderuleRewrite (DagNode *subject, RewritingContext &context)
virtual void saveHiddenState ()
virtual void setFrozen (const NatSet &frozen)
void setLineNumber (int lineNr)
void setModuleInfo (Module *module, int indexWithinModule)
void setStrategy (const Vector< int > &userStrategy, int nrArgs, bool memoFlag)
bool sortConstraintFree () const
void stackArguments (DagNode *subject, Vector< RedexPosition > &stack, int parentIndex)
bool standardStrategy () const
 StringSymbol (int id)
int traverse (int position, int sortIndex) const
bool unevaluatedArguments () const
virtual int unificationPriority () const

Protected Member Functions

bool acceptEquation (Equation *equation)
bool acceptRule (Rule *rule)
bool acceptSortConstraint (SortConstraint *sortConstraint)
bool applyReplace (DagNode *subject, RewritingContext &context, ExtensionInfo *extensionInfo=0)
bool applyReplaceNoOwise (DagNode *subject, RewritingContext &context, ExtensionInfo *extensionInfo=0)
DagNodeapplyRules (DagNode *subject, RewritingContext &context, ExtensionInfo *extensionInfo)
int ctorTraverse (int position, int sortIndex) const
void resetEachRule ()
bool safeToInspectSortConstraints ()
bool specialSortHandling () const

Static Protected Attributes

static const Vector< int > standard

Private Attributes

SortcharSort
Sortsort

Detailed Description

Definition at line 30 of file stringSymbol.hh.


The documentation for this class was generated from the following files:

Generated by  Doxygen 1.6.0   Back to index