LexicalToken.java

/******************************************************************************* 
 * Copyright (c) 2007 Red Hat, Inc. 
 * Distributed under license by Red Hat, Inc. All rights reserved. 
 * This program is made available under the terms of the 
 * Eclipse Public License v1.0 which accompanies this distribution, 
 * and is available at http://www.eclipse.org/legal/epl-v10.html 
 * 
 * Contributors: 
 * Red Hat, Inc. - initial API and implementation 
 ******************************************************************************/ 
package org.jboss.tools.common.el.core.parser;

import org.eclipse.jface.text.rules.IToken;

public class LexicalToken implements IToken {
	private LexicalToken previous;
	private LexicalToken next;

	private int start;
	private int length;
	private CharSequence chars;
	private int type;

	/**
	 * Constructs the ELToken object
	 *
	 * @param start
	 * @param length
	 * @param chars
	 * @param type
	 */
	public LexicalToken(int start, int length, CharSequence chars, int type) {
		this.start = start;
		this.length = length;
		this.chars = chars;
		this.type = type;
	}

	/**
	 * Returns string representation for the token
	 */
	public String toString() {
		return "ELToken(" + start + ", " + length + ", " + type + ") [" + (chars == null ? "<Empty>" : chars.toString()) + "]"; //$NON-NLS-1$ //$NON-NLS-2$ //$NON-NLS-3$ //$NON-NLS-4$ //$NON-NLS-5$ //$NON-NLS-6$
	}

	/*
	 * @see org.eclipse.jface.text.rules.IToken#getData()
	 */
	public Object getData() {
//		return (chars == null ? null : chars.subSequence(start, start+length).toString());
		return getText();
	}

	/**
	 * @return offset of token
	 */
	public int getStart() {
		return start;
	}

	/**
	 * @return length of token
	 */
	public int getLength() {
		return length;
	}

	/*
	 * @see org.eclipse.jface.text.rules.IToken#isEOF()
	 */
	public boolean isEOF() {
		return (start == -1 && length == -1 && chars == null);
	}
	
	/*
	 * @see org.eclipse.jface.text.rules.IToken#isOther()
	 */
	public boolean isOther() {
		return false;
	}

	/*
	 * @see org.eclipse.jface.text.rules.IToken#isUndefined()
	 */
	public boolean isUndefined() {
		return false;
	}

	/*
	 * @see org.eclipse.jface.text.rules.IToken#isWhitespace()
	 */
	public boolean isWhitespace() {
		return false;
	}

	/*
	 * Returns the token type
	 */
	public int getType(){
		return type;
	}

	public void setType(int type) {
		this.type = type;
	}

	/*
	 * Returns the token text
	 */
	public String getText() {
		return chars.toString();
	}

	public LexicalToken getPreviousToken() {
		return previous;
	}
	
	public LexicalToken getNextToken() {
		return next;
	}

	public void setNextToken(LexicalToken n) {
		if(n != null) {
			n.previous = this;
		}
		next = n;
	}

	void makeItFirst() {
		previous = null;
	}

	public LexicalToken findTokenBackword(int type) {
		if(previous == null) return null;
		if(previous.type == type) return previous;
		return previous.findTokenBackword(type);
	}

	public LexicalToken findTokenForward(int type) {
		if(next == null) return null;
		if(next.type == type) return next;
		return next.findTokenForward(type);
	}

	public void shift(int delta) {
		start += delta;
		if(next != null) next.shift(delta);
	}

	/**
	 * Computes combined token that starts with this token and ends with last token
	 * @param last
	 * @return
	 */
	public LexicalToken getCombinedToken(LexicalToken last) {
		StringBuffer sb = new StringBuffer();
		LexicalToken t = this;
		while(t != null && t != last) {
			sb.append(t.getText());
			t = t.getNextToken();
		}
		if(t != null) sb.append(t.getText());
		LexicalToken token = new LexicalToken(this.start, last.getStart() + last.getLength() - start, sb.toString(), this.type);
		token.previous = this.previous;
		token.next = last.next;
		return token;
	}

}