1 /* 2 * Copyright (c) 2011, 2013, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 */ 25 26 package com.sun.javafx.css.parser; 27 28 29 public class LexerState { 30 31 /** 32 * Determine whether or not this state accepts the character. If the 33 * character is accepted, then this state will be entered. 34 * @param c the character to test 35 * @return true if this state should be entered 36 */ 37 public boolean accepts(int c) { 38 final int nRecognizers = recognizers != null ? recognizers.length : 0; 39 for(int n=0; n<nRecognizers; n++) { 40 if (this.recognizers[n].recognize(c)) return true; 41 } 42 return false; 43 } 44 45 public int getType() { 46 return type; 47 } 48 49 public LexerState(int type, String name, Recognizer recognizer, Recognizer... others) { 50 assert(name != null); 51 this.type = type; 52 this.name = name; 53 if (recognizer != null) { 54 final int nRecognizers = 1 + (others != null ? others.length : 0); 55 this.recognizers = new Recognizer[nRecognizers]; 56 this.recognizers[0] = recognizer; 57 for(int n=1; n<recognizers.length; n++) { 58 this.recognizers[n] = others[n-1]; 59 } 60 } else { 61 this.recognizers = null; 62 } 63 } 64 65 public LexerState(String name, Recognizer recognizer, Recognizer... others) { 66 this(Token.INVALID, name, recognizer, others); 67 } 68 69 private LexerState() { 70 this(Token.INVALID, "invalid", null); 71 } 72 73 private final int type; 74 private final String name; 75 private final Recognizer[] recognizers; 76 77 @Override public String toString() { 78 return name; 79 } 80 81 @Override public boolean equals(Object other) { 82 if (this == other) return true; 83 return (other instanceof LexerState) ? 84 this.name.equals(((LexerState)other).name) : false; 85 } 86 87 @Override public int hashCode() { 88 return name.hashCode(); 89 } 90 91 }