You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
159 lines
4.3 KiB
159 lines
4.3 KiB
#ifndef INC_InputBuffer_hpp__
|
|
#define INC_InputBuffer_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>
|
|
*/
|
|
|
|
/**A Stream of characters fed to the lexer from a InputStream that can
|
|
* be rewound via mark()/rewind() methods.
|
|
* <p>
|
|
* A dynamic array is used to buffer up all the input characters. Normally,
|
|
* "k" characters are stored in the buffer. More characters may be stored during
|
|
* guess mode (testing syntactic predicate), or when LT(i>k) is referenced.
|
|
* Consumption of characters is deferred. In other words, reading the next
|
|
* character is not done by conume(), but deferred until needed by LA or LT.
|
|
* <p>
|
|
*
|
|
* @see antlr.CharQueue
|
|
*/
|
|
|
|
#include "antlr/config.h"
|
|
#include "antlr/CircularQueue.h"
|
|
#include <string>
|
|
|
|
ANTLR_BEGIN_NAMESPACE(antlr)
|
|
|
|
class InputBuffer {
|
|
protected:
|
|
// char source
|
|
// leave to subclasses
|
|
|
|
// Number of active markers
|
|
int nMarkers; // = 0;
|
|
|
|
// Additional offset used when markers are active
|
|
int markerOffset; // = 0;
|
|
|
|
// Number of calls to consume() since last LA() or LT() call
|
|
int numToConsume; // = 0;
|
|
|
|
// Circular queue
|
|
CircularQueue<int> queue;
|
|
|
|
public:
|
|
/** Create a character buffer */
|
|
InputBuffer();
|
|
|
|
virtual ~InputBuffer() {}
|
|
|
|
/** This method updates the state of the input buffer so that
|
|
* the text matched since the most recent mark() is no longer
|
|
* held by the buffer. So, you either do a mark/rewind for
|
|
* failed predicate or mark/commit to keep on parsing without
|
|
* rewinding the input.
|
|
*/
|
|
void commit();
|
|
|
|
/** Mark another character for deferred consumption */
|
|
virtual void consume();
|
|
|
|
/** Ensure that the character buffer is sufficiently full */
|
|
virtual void fill(int amount);
|
|
|
|
/** Override this in subclasses to get the next character */
|
|
virtual int getChar()=0;
|
|
|
|
ANTLR_USE_NAMESPACE(std)string getLAChars() const;
|
|
|
|
ANTLR_USE_NAMESPACE(std)string getMarkedChars() const;
|
|
|
|
virtual bool isMarked() const;
|
|
|
|
/** Get a lookahead character */
|
|
virtual int LA(int i);
|
|
|
|
/**Return an integer marker that can be used to rewind the buffer to
|
|
* its current state.
|
|
*/
|
|
virtual int mark();
|
|
|
|
/**Rewind the character buffer to a marker.
|
|
* @param mark Marker returned previously from mark()
|
|
*/
|
|
virtual void rewind(int mark);
|
|
|
|
protected:
|
|
/** Sync up deferred consumption */
|
|
void syncConsume();
|
|
|
|
private:
|
|
InputBuffer(const InputBuffer& other);
|
|
InputBuffer& operator=(const InputBuffer& other);
|
|
};
|
|
|
|
/** Sync up deferred consumption */
|
|
inline void InputBuffer::syncConsume() {
|
|
#ifdef OLD_CODE
|
|
while (numToConsume > 0) {
|
|
if (nMarkers > 0)
|
|
{
|
|
// guess mode -- leave leading characters and bump offset.
|
|
markerOffset++;
|
|
} else {
|
|
// normal mode -- remove first character
|
|
queue.removeFirst();
|
|
}
|
|
numToConsume--;
|
|
}
|
|
#endif
|
|
|
|
if (numToConsume > 0) {
|
|
if (nMarkers > 0) {
|
|
markerOffset += numToConsume;
|
|
} else {
|
|
queue.removeItems( numToConsume );
|
|
}
|
|
numToConsume = 0;
|
|
}
|
|
}
|
|
|
|
/** Get a lookahead character */
|
|
inline int InputBuffer::LA(int i)
|
|
{
|
|
fill(i);
|
|
return queue.elementAt(markerOffset + i - 1);
|
|
}
|
|
|
|
ANTLR_END_NAMESPACE
|
|
|
|
#endif //INC_InputBuffer_hpp__
|