54 lines
2.1 KiB
C
54 lines
2.1 KiB
C
|
/*
|
||
|
|
* [The "BSD license"]
|
||
|
|
* Copyright (c) 2012 Terence Parr
|
||
|
|
* Copyright (c) 2012 Sam Harwell
|
||
|
|
* 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.
|
||
|
|
* 3. The name of the author may not be used to endorse or promote products
|
||
|
|
* derived from this software without specific prior written permission.
|
||
|
|
*
|
||
|
|
* 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.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include "antlr4-common.h"
|
||
|
|
|
||
|
|
#include "tree/ParseTreeWalker.h"
|
||
|
|
|
||
|
|
namespace antlr4 {
|
||
|
|
namespace tree {
|
||
|
|
|
||
|
|
class ParseTreeListener;
|
||
|
|
|
||
|
|
/**
|
||
|
|
* An iterative (read: non-recursive) pre-order and post-order tree walker that
|
||
|
|
* doesn't use the thread stack but heap-based stacks. Makes it possible to
|
||
|
|
* process deeply nested parse trees.
|
||
|
|
*/
|
||
|
|
class ANTLR4CPP_PUBLIC IterativeParseTreeWalker : public ParseTreeWalker {
|
||
|
|
public:
|
||
|
|
virtual void walk(ParseTreeListener *listener, ParseTree *t) const override;
|
||
|
|
};
|
||
|
|
|
||
|
|
} // namespace tree
|
||
|
|
} // namespace antlr4
|