mirror of https://github.com/acidanthera/audk.git
88 lines
2.6 KiB
Java
88 lines
2.6 KiB
Java
|
/*
|
||
|
*
|
||
|
* Copyright 2004 The Ant-Contrib project
|
||
|
*
|
||
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
||
|
* you may not use this file except in compliance with the License.
|
||
|
* You may obtain a copy of the License at
|
||
|
*
|
||
|
* http://www.apache.org/licenses/LICENSE-2.0
|
||
|
*
|
||
|
* Unless required by applicable law or agreed to in writing, software
|
||
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
||
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||
|
* See the License for the specific language governing permissions and
|
||
|
* limitations under the License.
|
||
|
*/
|
||
|
package net.sf.antcontrib.cpptasks.parser;
|
||
|
|
||
|
/**
|
||
|
* This parser state checks consumed characters against a specific character
|
||
|
* (case insensitive).
|
||
|
*
|
||
|
* @author Curt Arnold
|
||
|
*/
|
||
|
public final class CaseInsensitiveLetterState
|
||
|
extends AbstractParserState {
|
||
|
/**
|
||
|
* Next state if a match is found.
|
||
|
*/
|
||
|
private final AbstractParserState nextState;
|
||
|
|
||
|
/**
|
||
|
* Next state if not match is found.
|
||
|
*/
|
||
|
private final AbstractParserState noMatchState;
|
||
|
|
||
|
/**
|
||
|
* Lower case version of character to match.
|
||
|
*/
|
||
|
private final char lowerLetter;
|
||
|
|
||
|
/**
|
||
|
* Lower case version of character to match.
|
||
|
*/
|
||
|
private final char upperLetter;
|
||
|
|
||
|
/**
|
||
|
* Constructor.
|
||
|
*
|
||
|
* @param parser
|
||
|
* parser
|
||
|
* @param matchLetter
|
||
|
* letter to match
|
||
|
* @param nextStateArg
|
||
|
* next state if a match on the letter
|
||
|
* @param noMatchStateArg
|
||
|
* state if no match on letter
|
||
|
*/
|
||
|
public CaseInsensitiveLetterState(final AbstractParser parser,
|
||
|
final char matchLetter,
|
||
|
final AbstractParserState nextStateArg,
|
||
|
final AbstractParserState noMatchStateArg) {
|
||
|
super(parser);
|
||
|
this.lowerLetter = Character.toLowerCase(matchLetter);
|
||
|
this.upperLetter = Character.toUpperCase(matchLetter);
|
||
|
this.nextState = nextStateArg;
|
||
|
this.noMatchState = noMatchStateArg;
|
||
|
}
|
||
|
|
||
|
/**
|
||
|
* Consumes a character and returns the next state for the parser.
|
||
|
*
|
||
|
* @param ch
|
||
|
* next character
|
||
|
* @return the configured nextState if ch is the expected character or the
|
||
|
* configure noMatchState otherwise.
|
||
|
*/
|
||
|
public AbstractParserState consume(final char ch) {
|
||
|
if (ch == lowerLetter || ch == upperLetter) {
|
||
|
return nextState;
|
||
|
}
|
||
|
if (ch == '\n') {
|
||
|
getParser().getNewLineState();
|
||
|
}
|
||
|
return noMatchState;
|
||
|
}
|
||
|
}
|