⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 astrefcount.hpp

📁 Java写的词法/语法分析器。可生成JAVA语言或者是C++的词法和语法分析器。并可产生语法分析树和对该树进行遍历
💻 HPP
字号:
#ifndef INC_ASTRefCount_hpp__#define INC_ASTRefCount_hpp__/** * <b>SOFTWARE RIGHTS</b> * <p> * ANTLR 2.6.0 MageLang Insitute, 1999 * <p> * We reserve no legal rights to the ANTLR--it is fully in the * public domain. An individual or company may do whatever * they wish with source code distributed with ANTLR or the * code generated by ANTLR, including the incorporation of * ANTLR, or its output, into commerical software. * <p> * We encourage users to develop software with ANTLR. However, * we do ask that credit is given to us for developing * ANTLR. By "credit", we mean that if you use ANTLR or * incorporate any source code into one of your programs * (commercial product, research project, or otherwise) that * you acknowledge this fact somewhere in the documentation, * research report, etc... If you like ANTLR and have * developed a nice tool with the output, please mention that * you developed it using ANTLR. In addition, we ask that the * headers remain intact in our source code. As long as these * guidelines are kept, we expect to continue enhancing this * system and expect to make other tools available as they are * completed. * <p> * The ANTLR gang: * @version ANTLR 2.6.0 MageLang Insitute, 1999 * @author Terence Parr, <a href=http://www.MageLang.com>MageLang Institute</a> * @author <br>John Lilley, <a href=http://www.Empathy.com>Empathy Software</a> * @author <br><a href="mailto:pete@yamuna.demon.co.uk">Pete Wells</a> */#include "antlr/config.hpp"ANTLR_BEGIN_NAMESPACE(antlr)class AST;struct ASTRef {	AST* const ptr;	unsigned int count;	ASTRef(AST* p);	~ASTRef();	ASTRef* increment();	bool decrement();	static ASTRef* getRef(const AST* p);};template<class T>class ASTRefCount {private:	ASTRef* ref;public:	ASTRefCount(const AST* p=0)		{			ref=p ? ASTRef::getRef(p) : 0;		}	ASTRefCount(const ASTRefCount<T>& other)		{			ref=other.ref ? other.ref->increment() : 0;		}	~ASTRefCount()		{			if (ref && ref->decrement()) delete ref;		}	ASTRefCount<T>& operator=(AST* other)		{			ASTRef* tmp=ASTRef::getRef(other);			if (ref && ref->decrement()) delete ref;			ref=tmp;			return *this;		}	ASTRefCount<T>& operator=(const ASTRefCount<T>& other)		{			ASTRef* tmp=other.ref ? other.ref->increment() : 0;			if (ref && ref->decrement()) delete ref;			ref=tmp;			return *this;		}	operator T* () const		{ return ref ? dynamic_cast<T*>(ref->ptr) : 0; }	T* operator->() const		{ return ref ? dynamic_cast<T*>(ref->ptr) : 0; }	T* get() const		{ return ref ? dynamic_cast<T*>(ref->ptr) : 0; }};typedef ASTRefCount<AST> RefAST;ANTLR_END_NAMESPACE#endif //INC_ASTRefCount_hpp__

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -