/*
* Copyright (c) 2012, 2014, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* The Universal Permissive License (UPL), Version 1.0
*
* Subject to the condition set forth below, permission is hereby granted to any
* person obtaining a copy of this software, associated documentation and/or
* data (collectively the "Software"), free of charge and under any and all
* copyright rights in the Software, and any and all patent rights owned or
* freely licensable by each licensor hereunder covering either (i) the
* unmodified Software as contributed to or provided by such licensor, or (ii)
* the Larger Works (as defined below), to deal in both
*
* (a) the Software, and
*
* (b) any piece of software and/or hardware listed in the lrgrwrks.txt file if
* one is included with the Software each a "Larger Work" to which the Software
* is contributed by such licensors),
*
* without restriction, including without limitation the rights to copy, create
* derivative works of, display, perform, and distribute the Software and make,
* use, sell, offer for sale, import, export, have made, and have sold the
* Software and the Larger Work(s), and to sublicense the foregoing rights on
* either these or other terms.
*
* This license is subject to the following condition:
*
* The above copyright notice and either this complete permission notice or at a
* minimum a reference to the UPL must be included in all copies or substantial
* portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
// The content of this file is automatically generated. DO NOT EDIT.
package com.oracle.truffle.sl.parser;
import java.io.IOException;
import java.io.InputStream;
import java.io.RandomAccessFile;
import java.util.HashMap;
import java.util.Map;
// Checkstyle: stop
// @formatter:off
class Token {
public int kind; // token kind
public int pos; // token position in bytes in the source text (starting at 0)
public int charPos; // token position in characters in the source text (starting at 0)
public int col; // token column (starting at 1)
public int line; // token line (starting at 1)
public String val; // token value
public Token next; // ML 2005-03-11 Peek tokens are kept in linked list
}
// -----------------------------------------------------------------------------------
// Buffer
// -----------------------------------------------------------------------------------
class Buffer {
// This Buffer supports the following cases:
// 1) seekable stream (file)
// a) whole stream in buffer
// b) part of stream in buffer
// 2) non seekable stream (network, console)
public static final int EOF = Character.MAX_VALUE + 1;
private static final int MIN_BUFFER_LENGTH = 1024; // 1KB
private static final int MAX_BUFFER_LENGTH = MIN_BUFFER_LENGTH * 64; // 64KB
private byte[] buf; // input buffer
private int bufStart; // position of first byte in buffer relative to input stream
private int bufLen; // length of buffer
private int fileLen; // length of input stream (may change if stream is no file)
private int bufPos; // current position in buffer
private RandomAccessFile file; // input stream (seekable)
private InputStream stream; // growing input stream (e.g.: console, network)
public Buffer(InputStream s) {
stream = s;
fileLen = bufLen = bufStart = bufPos = 0;
buf = new byte[MIN_BUFFER_LENGTH];
}
public Buffer(String fileName) {
try {
file = new RandomAccessFile(fileName, "r");
fileLen = (int) file.length();
bufLen = Math.min(fileLen, MAX_BUFFER_LENGTH);
buf = new byte[bufLen];
bufStart = Integer.MAX_VALUE; // nothing in buffer so far
if (fileLen > 0)
setPos(0); // setup buffer to position 0 (start)
else
bufPos = 0; // index 0 is already after the file, thus setPos(0) is invalid
if (bufLen == fileLen)
Close();
} catch (IOException e) {
throw new FatalError("Could not open file " + fileName);
}
}
// don't use b after this call anymore
// called in UTF8Buffer constructor
protected Buffer(Buffer b) {
buf = b.buf;
bufStart = b.bufStart;
bufLen = b.bufLen;
fileLen = b.fileLen;
bufPos = b.bufPos;
file = b.file;
stream = b.stream;
// keep finalize from closing the file
b.file = null;
}
@Override
protected void finalize() throws Throwable {
super.finalize();
Close();
}
protected void Close() {
if (file != null) {
try {
file.close();
file = null;
} catch (IOException e) {
throw new FatalError(e.getMessage());
}
}
}
public int Read() {
if (bufPos < bufLen) {
return buf[bufPos++] & 0xff; // mask out sign bits
} else if (getPos() < fileLen) {
setPos(getPos()); // shift buffer start to pos
return buf[bufPos++] & 0xff; // mask out sign bits
} else if (stream != null && ReadNextStreamChunk() > 0) {
return buf[bufPos++] & 0xff; // mask out sign bits
} else {
return EOF;
}
}
public int Peek() {
int curPos = getPos();
int ch = Read();
setPos(curPos);
return ch;
}
// beg .. begin, zero-based, inclusive, in byte
// end .. end, zero-based, exclusive, in byte
public String GetString(int beg, int end) {
int len = 0;
char[] buffer = new char[end - beg];
int oldPos = getPos();
setPos(beg);
while (getPos() < end)
buffer[len++] = (char) Read();
setPos(oldPos);
return new String(buffer, 0, len);
}
public int getPos() {
return bufPos + bufStart;
}
public void setPos(int value) {
if (value >= fileLen && stream != null) {
// Wanted position is after buffer and the stream
// is not seek-able e.g. network or console,
// thus we have to read the stream manually till
// the wanted position is in sight.
while (value >= fileLen && ReadNextStreamChunk() > 0) {
// nothing to do...
}
}
if (value < 0 || value > fileLen) {
throw new FatalError("buffer out of bounds access, position: " + value);
}
if (value >= bufStart && value < bufStart + bufLen) { // already in buffer
bufPos = value - bufStart;
} else if (file != null) { // must be swapped in
try {
file.seek(value);
bufLen = file.read(buf);
bufStart = value;
bufPos = 0;
} catch (IOException e) {
throw new FatalError(e.getMessage());
}
} else {
// set the position to the end of the file, Pos will return fileLen.
bufPos = fileLen - bufStart;
}
}
// Read the next chunk of bytes from the stream, increases the buffer
// if needed and updates the fields fileLen and bufLen.
// Returns the number of bytes read.
private int ReadNextStreamChunk() {
int free = buf.length - bufLen;
if (free == 0) {
// in the case of a growing input stream
// we can neither seek in the stream, nor can we
// foresee the maximum length, thus we must adapt
// the buffer size on demand.
byte[] newBuf = new byte[bufLen * 2];
System.arraycopy(buf, 0, newBuf, 0, bufLen);
buf = newBuf;
free = bufLen;
}
int read;
try {
read = stream.read(buf, bufLen, free);
} catch (IOException ioex) {
throw new FatalError(ioex.getMessage());
}
if (read > 0) {
fileLen = bufLen = (bufLen + read);
return read;
}
// end of stream reached
return 0;
}
}
// -----------------------------------------------------------------------------------
// UTF8Buffer
// -----------------------------------------------------------------------------------
class UTF8Buffer extends Buffer {
UTF8Buffer(Buffer b) {
super(b);
}
@Override
public int Read() {
int ch;
do {
ch = super.Read();
// until we find a utf8 start (0xxxxxxx or 11xxxxxx)
} while ((ch >= 128) && ((ch & 0xC0) != 0xC0) && (ch != EOF));
if (ch < 128 || ch == EOF) {
// nothing to do, first 127 chars are the same in ascii and utf8
// 0xxxxxxx or end of file character
} else if ((ch & 0xF0) == 0xF0) {
// 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
int c1 = ch & 0x07;
ch = super.Read();
int c2 = ch & 0x3F;
ch = super.Read();
int c3 = ch & 0x3F;
ch = super.Read();
int c4 = ch & 0x3F;
ch = (((((c1 << 6) | c2) << 6) | c3) << 6) | c4;
} else if ((ch & 0xE0) == 0xE0) {
// 1110xxxx 10xxxxxx 10xxxxxx
int c1 = ch & 0x0F;
ch = super.Read();
int c2 = ch & 0x3F;
ch = super.Read();
int c3 = ch & 0x3F;
ch = (((c1 << 6) | c2) << 6) | c3;
} else if ((ch & 0xC0) == 0xC0) {
// 110xxxxx 10xxxxxx
int c1 = ch & 0x1F;
ch = super.Read();
int c2 = ch & 0x3F;
ch = (c1 << 6) | c2;
}
return ch;
}
}
// -----------------------------------------------------------------------------------
// StartStates -- maps characters to start states of tokens
// -----------------------------------------------------------------------------------
class StartStates {
private static class Elem {
public int key, val;
public Elem next;
public Elem(int key, int val) {
this.key = key;
this.val = val;
}
}
private Elem[] tab = new Elem[128];
public void set(int key, int val) {
Elem e = new Elem(key, val);
int k = key % 128;
e.next = tab[k];
tab[k] = e;
}
public int state(int key) {
Elem e = tab[key % 128];
while (e != null && e.key != key)
e = e.next;
return e == null ? 0 : e.val;
}
}
// -----------------------------------------------------------------------------------
// Scanner
// -----------------------------------------------------------------------------------
public class Scanner {
static final char EOL = '\n';
static final int eofSym = 0;
static final int maxT = 34;
static final int noSym = 34;
public Buffer buffer; // scanner buffer
Token t; // current token
int ch; // current input character
int pos; // byte position of current character
int charPos; // position by unicode characters starting with 0
int col; // column number of current character
int line; // line number of current character
int oldEols; // EOLs that appeared in a comment;
static final StartStates start; // maps initial token character to start state
static final Map<String, Integer> literals; // maps literal strings to literal kinds
Token tokens; // list of tokens already peeked (first token is a dummy)
Token pt; // current peek token
char[] tval = new char[16]; // token text used in NextToken(), dynamically enlarged
int tlen; // length of current token
static {
start = new StartStates();
literals = new HashMap<>();
for (int i = 65; i <= 90; ++i) start.set(i, 1);
for (int i = 97; i <= 122; ++i) start.set(i, 1);
for (int i = 49; i <= 57; ++i) start.set(i, 4);
start.set(34, 2);
start.set(48, 5);
start.set(40, 6);
start.set(44, 7);
start.set(41, 8);
start.set(123, 9);
start.set(125, 10);
start.set(59, 11);
start.set(124, 12);
start.set(38, 14);
start.set(60, 28);
start.set(62, 29);
start.set(61, 30);
start.set(33, 19);
start.set(43, 21);
start.set(45, 22);
start.set(42, 23);
start.set(47, 24);
start.set(46, 25);
start.set(91, 26);
start.set(93, 27);
start.set(Buffer.EOF, -1);
literals.put("function", new Integer(4));
literals.put("break", new Integer(10));
literals.put("continue", new Integer(12));
literals.put("debugger", new Integer(13));
literals.put("while", new Integer(14));
literals.put("if", new Integer(15));
literals.put("else", new Integer(16));
literals.put("return", new Integer(17));
}
public Scanner(String fileName) {
buffer = new Buffer(fileName);
Init();
}
public Scanner(InputStream s) {
buffer = new Buffer(s);
Init();
}
void Init() {
pos = -1;
line = 1;
col = 0;
charPos = -1;
oldEols = 0;
NextCh();
if (ch == 0xEF) { // check optional byte order mark for UTF-8
NextCh();
int ch1 = ch;
NextCh();
int ch2 = ch;
if (ch1 != 0xBB || ch2 != 0xBF) {
throw new FatalError("Illegal byte order mark at start of file");
}
buffer = new UTF8Buffer(buffer);
col = 0;
charPos = -1;
NextCh();
}
pt = tokens = new Token(); // first token is a dummy
}
void NextCh() {
if (oldEols > 0) {
ch = EOL;
oldEols--;
} else {
pos = buffer.getPos();
// buffer reads unicode chars, if UTF8 has been detected
ch = buffer.Read();
col++;
charPos++;
// replace isolated '\r' by '\n' in order to make
// eol handling uniform across Windows, Unix and Mac
if (ch == '\r' && buffer.Peek() != '\n')
ch = EOL;
if (ch == EOL) {
line++;
col = 0;
}
}
}
void AddCh() {
if (tlen >= tval.length) {
char[] newBuf = new char[2 * tval.length];
System.arraycopy(tval, 0, newBuf, 0, tval.length);
tval = newBuf;
}
if (ch != Buffer.EOF) {
tval[tlen++] = (char)ch;
NextCh();
}
}
boolean Comment0() {
int level = 1, pos0 = pos, line0 = line, col0 = col, charPos0 = charPos;
NextCh();
if (ch == '/') {
NextCh();
for(;;) {
if (ch == 10) {
level--;
if (level == 0) { oldEols = line - line0; NextCh(); return true; }
NextCh();
} else if (ch == Buffer.EOF) return false;
else NextCh();
}
} else {
buffer.setPos(pos0); NextCh(); line = line0; col = col0; charPos = charPos0;
}
return false;
}
boolean Comment1() {
int level = 1, pos0 = pos, line0 = line, col0 = col, charPos0 = charPos;
NextCh();
if (ch == '*') {
NextCh();
for(;;) {
if (ch == '*') {
NextCh();
if (ch == '/') {
level--;
if (level == 0) { oldEols = line - line0; NextCh(); return true; }
NextCh();
}
} else if (ch == Buffer.EOF) return false;
else NextCh();
}
} else {
buffer.setPos(pos0); NextCh(); line = line0; col = col0; charPos = charPos0;
}
return false;
}
void CheckLiteral() {
String val = t.val;
Object kind = literals.get(val);
if (kind != null) {
t.kind = ((Integer) kind).intValue();
}
}
Token NextToken() {
while (ch == ' ' ||
ch >= 9 && ch <= 10 || ch == 13
) NextCh();
if (ch == '/' && Comment0() ||ch == '/' && Comment1()) return NextToken();
int recKind = noSym;
int recEnd = pos;
t = new Token();
t.pos = pos;
t.col = col;
t.line = line;
t.charPos = charPos;
int state = start.state(ch);
tlen = 0;
AddCh();
loop: for (;;) {
switch (state) {
case -1: {
t.kind = eofSym;
break loop;
} // NextCh already done
case 0: {
if (recKind != noSym) {
tlen = recEnd - t.pos;
SetScannerBehindT();
}
t.kind = recKind;
break loop;
} // NextCh already done
case 1:
recEnd = pos; recKind = 1;
if (ch >= '0' && ch <= '9' || ch >= 'A' && ch <= 'Z' || ch >= 'a' && ch <= 'z') {AddCh(); state = 1; break;}
else {t.kind = 1; t.val = new String(tval, 0, tlen); CheckLiteral(); return t;}
case 2:
if (ch <= 9 || ch >= 11 && ch <= 12 || ch >= 14 && ch <= '!' || ch >= '#' && ch <= '[' || ch >= ']' && ch <= 65535) {AddCh(); state = 2; break;}
else if (ch == '"') {AddCh(); state = 3; break;}
else {state = 0; break;}
case 3:
{t.kind = 2; break loop;}
case 4:
recEnd = pos; recKind = 3;
if (ch >= '0' && ch <= '9') {AddCh(); state = 4; break;}
else {t.kind = 3; break loop;}
case 5:
{t.kind = 3; break loop;}
case 6:
{t.kind = 5; break loop;}
case 7:
{t.kind = 6; break loop;}
case 8:
{t.kind = 7; break loop;}
case 9:
{t.kind = 8; break loop;}
case 10:
{t.kind = 9; break loop;}
case 11:
{t.kind = 11; break loop;}
case 12:
if (ch == '|') {AddCh(); state = 13; break;}
else {state = 0; break;}
case 13:
{t.kind = 18; break loop;}
case 14:
if (ch == '&') {AddCh(); state = 15; break;}
else {state = 0; break;}
case 15:
{t.kind = 19; break loop;}
case 16:
{t.kind = 21; break loop;}
case 17:
{t.kind = 23; break loop;}
case 18:
{t.kind = 24; break loop;}
case 19:
if (ch == '=') {AddCh(); state = 20; break;}
else {state = 0; break;}
case 20:
{t.kind = 25; break loop;}
case 21:
{t.kind = 26; break loop;}
case 22:
{t.kind = 27; break loop;}
case 23:
{t.kind = 28; break loop;}
case 24:
{t.kind = 29; break loop;}
case 25:
{t.kind = 31; break loop;}
case 26:
{t.kind = 32; break loop;}
case 27:
{t.kind = 33; break loop;}
case 28:
recEnd = pos; recKind = 20;
if (ch == '=') {AddCh(); state = 16; break;}
else {t.kind = 20; break loop;}
case 29:
recEnd = pos; recKind = 22;
if (ch == '=') {AddCh(); state = 17; break;}
else {t.kind = 22; break loop;}
case 30:
recEnd = pos; recKind = 30;
if (ch == '=') {AddCh(); state = 18; break;}
else {t.kind = 30; break loop;}
}
}
t.val = new String(tval, 0, tlen);
return t;
}
private void SetScannerBehindT() {
buffer.setPos(t.pos);
NextCh();
line = t.line;
col = t.col;
charPos = t.charPos;
for (int i = 0; i < tlen; i++)
NextCh();
}
// get the next token (possibly a token already seen during peeking)
public Token Scan() {
if (tokens.next == null) {
return NextToken();
} else {
pt = tokens = tokens.next;
return tokens;
}
}
// get the next token, ignore pragmas
public Token Peek() {
do {
if (pt.next == null) {
pt.next = NextToken();
}
pt = pt.next;
} while (pt.kind > maxT); // skip pragmas
return pt;
}
// make sure that peeking starts at current scan position
public void ResetPeek() {
pt = tokens;
}
// The following methods are used for the CLNG Editor and will be called with java.Reflection.
// If the editor won't be used these 3 functions are obsolete,
// otherwise changes within the signature of the methods will result in Syntax Highlighting not working properly
// anymore.
// get the offset of the next Token
public int getPeekTokenOffset() {
return pt.pos;
}
// get the String value of the Token
public String getPeekTokenVal() {
return pt.val;
}
// get the Kind value of the Token
public int getPeekTokenKind() {
return pt.kind;
}
} // end Scanner