forked from qt-creator/qt-creator
Update the qtcreator qmljs parser to the one of Qt 5.12. It supports EcmaScript 7. Task-number: QTCREATORBUG-20341 Change-Id: I0d1cff71402ba17e22cde6b46c65614e162280de Reviewed-by: Erik Verbruggen <erik.verbruggen@qt.io>
908 lines
24 KiB
C++
908 lines
24 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2016 The Qt Company Ltd.
|
|
** Contact: https://www.qt.io/licensing/
|
|
**
|
|
** This file is part of Qt Creator.
|
|
**
|
|
** Commercial License Usage
|
|
** Licensees holding valid commercial Qt licenses may use this file in
|
|
** accordance with the commercial license agreement provided with the
|
|
** Software or, alternatively, in accordance with the terms contained in
|
|
** a written agreement between you and The Qt Company. For licensing terms
|
|
** and conditions see https://www.qt.io/terms-conditions. For further
|
|
** information use the contact form at https://www.qt.io/contact-us.
|
|
**
|
|
** GNU General Public License Usage
|
|
** Alternatively, this file may be used under the terms of the GNU
|
|
** General Public License version 3 as published by the Free Software
|
|
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
|
|
** included in the packaging of this file. Please review the following
|
|
** information to ensure the GNU General Public License requirements will
|
|
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
|
|
**
|
|
****************************************************************************/
|
|
|
|
#pragma once
|
|
|
|
//
|
|
// W A R N I N G
|
|
// -------------
|
|
//
|
|
// This file is not part of the Qt API. It exists purely as an
|
|
// implementation detail. This header file may change from version to
|
|
// version without notice, or even be removed.
|
|
//
|
|
// We mean it.
|
|
//
|
|
|
|
#include "qmljslexer_p.h"
|
|
|
|
QT_QML_BEGIN_NAMESPACE
|
|
|
|
namespace QmlJS {
|
|
|
|
static inline int classify2(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 'a') {
|
|
if (s[1].unicode() == 's') {
|
|
return Lexer::T_AS;
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'd') {
|
|
if (s[1].unicode() == 'o') {
|
|
return Lexer::T_DO;
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'i') {
|
|
if (s[1].unicode() == 'f') {
|
|
return Lexer::T_IF;
|
|
}
|
|
else if (s[1].unicode() == 'n') {
|
|
return Lexer::T_IN;
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'o') {
|
|
if (s[1].unicode() == 'n') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? Lexer::T_ON : Lexer::T_IDENTIFIER;
|
|
}
|
|
else if (s[1].unicode() == 'f') {
|
|
return Lexer::T_OF;
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
static inline int classify3(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 'f') {
|
|
if (s[1].unicode() == 'o') {
|
|
if (s[2].unicode() == 'r') {
|
|
return Lexer::T_FOR;
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'g') {
|
|
if (s[1].unicode() == 'e') {
|
|
if (s[2].unicode() == 't') {
|
|
return Lexer::T_GET;
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'i') {
|
|
if (s[1].unicode() == 'n') {
|
|
if (s[2].unicode() == 't') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_INT) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'l') {
|
|
if (s[1].unicode() == 'e') {
|
|
if (s[2].unicode() == 't') {
|
|
return int(Lexer::T_LET);
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'n') {
|
|
if (s[1].unicode() == 'e') {
|
|
if (s[2].unicode() == 'w') {
|
|
return Lexer::T_NEW;
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 's') {
|
|
if (s[1].unicode() == 'e') {
|
|
if (s[2].unicode() == 't') {
|
|
return Lexer::T_SET;
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 't') {
|
|
if (s[1].unicode() == 'r') {
|
|
if (s[2].unicode() == 'y') {
|
|
return Lexer::T_TRY;
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'v') {
|
|
if (s[1].unicode() == 'a') {
|
|
if (s[2].unicode() == 'r') {
|
|
return Lexer::T_VAR;
|
|
}
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
static inline int classify4(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 'b') {
|
|
if (s[1].unicode() == 'y') {
|
|
if (s[2].unicode() == 't') {
|
|
if (s[3].unicode() == 'e') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_BYTE) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'c') {
|
|
if (s[1].unicode() == 'a') {
|
|
if (s[2].unicode() == 's') {
|
|
if (s[3].unicode() == 'e') {
|
|
return Lexer::T_CASE;
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'h') {
|
|
if (s[2].unicode() == 'a') {
|
|
if (s[3].unicode() == 'r') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_CHAR) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'e') {
|
|
if (s[1].unicode() == 'l') {
|
|
if (s[2].unicode() == 's') {
|
|
if (s[3].unicode() == 'e') {
|
|
return Lexer::T_ELSE;
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'n') {
|
|
if (s[2].unicode() == 'u') {
|
|
if (s[3].unicode() == 'm') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_ENUM) : int(Lexer::T_RESERVED_WORD);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'f') {
|
|
if (s[1].unicode() == 'r') {
|
|
if (s[2].unicode() == 'o') {
|
|
if (s[3].unicode() == 'm') {
|
|
return int(Lexer::T_FROM);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'g') {
|
|
if (s[1].unicode() == 'o') {
|
|
if (s[2].unicode() == 't') {
|
|
if (s[3].unicode() == 'o') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_GOTO) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'l') {
|
|
if (s[1].unicode() == 'o') {
|
|
if (s[2].unicode() == 'n') {
|
|
if (s[3].unicode() == 'g') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_LONG) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'n') {
|
|
if (s[1].unicode() == 'u') {
|
|
if (s[2].unicode() == 'l') {
|
|
if (s[3].unicode() == 'l') {
|
|
return Lexer::T_NULL;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 't') {
|
|
if (s[1].unicode() == 'h') {
|
|
if (s[2].unicode() == 'i') {
|
|
if (s[3].unicode() == 's') {
|
|
return Lexer::T_THIS;
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'r') {
|
|
if (s[2].unicode() == 'u') {
|
|
if (s[3].unicode() == 'e') {
|
|
return Lexer::T_TRUE;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'v') {
|
|
if (s[1].unicode() == 'o') {
|
|
if (s[2].unicode() == 'i') {
|
|
if (s[3].unicode() == 'd') {
|
|
return Lexer::T_VOID;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'w') {
|
|
if (s[1].unicode() == 'i') {
|
|
if (s[2].unicode() == 't') {
|
|
if (s[3].unicode() == 'h') {
|
|
return Lexer::T_WITH;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
static inline int classify5(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 'b') {
|
|
if (s[1].unicode() == 'r') {
|
|
if (s[2].unicode() == 'e') {
|
|
if (s[3].unicode() == 'a') {
|
|
if (s[4].unicode() == 'k') {
|
|
return Lexer::T_BREAK;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'c') {
|
|
if (s[1].unicode() == 'a') {
|
|
if (s[2].unicode() == 't') {
|
|
if (s[3].unicode() == 'c') {
|
|
if (s[4].unicode() == 'h') {
|
|
return Lexer::T_CATCH;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'l') {
|
|
if (s[2].unicode() == 'a') {
|
|
if (s[3].unicode() == 's') {
|
|
if (s[4].unicode() == 's') {
|
|
return Lexer::T_CLASS;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'o') {
|
|
if (s[2].unicode() == 'n') {
|
|
if (s[3].unicode() == 's') {
|
|
if (s[4].unicode() == 't') {
|
|
return int(Lexer::T_CONST);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'f') {
|
|
if (s[1].unicode() == 'a') {
|
|
if (s[2].unicode() == 'l') {
|
|
if (s[3].unicode() == 's') {
|
|
if (s[4].unicode() == 'e') {
|
|
return Lexer::T_FALSE;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'i') {
|
|
if (s[2].unicode() == 'n') {
|
|
if (s[3].unicode() == 'a') {
|
|
if (s[4].unicode() == 'l') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_FINAL) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'l') {
|
|
if (s[2].unicode() == 'o') {
|
|
if (s[3].unicode() == 'a') {
|
|
if (s[4].unicode() == 't') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_FLOAT) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 's') {
|
|
if (s[1].unicode() == 'h') {
|
|
if (s[2].unicode() == 'o') {
|
|
if (s[3].unicode() == 'r') {
|
|
if (s[4].unicode() == 't') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_SHORT) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'u') {
|
|
if (s[2].unicode() == 'p') {
|
|
if (s[3].unicode() == 'e') {
|
|
if (s[4].unicode() == 'r') {
|
|
return int(Lexer::T_SUPER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 't') {
|
|
if (s[1].unicode() == 'h') {
|
|
if (s[2].unicode() == 'r') {
|
|
if (s[3].unicode() == 'o') {
|
|
if (s[4].unicode() == 'w') {
|
|
return Lexer::T_THROW;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'w') {
|
|
if (s[1].unicode() == 'h') {
|
|
if (s[2].unicode() == 'i') {
|
|
if (s[3].unicode() == 'l') {
|
|
if (s[4].unicode() == 'e') {
|
|
return Lexer::T_WHILE;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'y') {
|
|
if (s[1].unicode() == 'i') {
|
|
if (s[2].unicode() == 'e') {
|
|
if (s[3].unicode() == 'l') {
|
|
if (s[4].unicode() == 'd') {
|
|
return (parseModeFlags & Lexer::YieldIsKeyword) ? Lexer::T_YIELD : Lexer::T_IDENTIFIER;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
static inline int classify6(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 'd') {
|
|
if (s[1].unicode() == 'e') {
|
|
if (s[2].unicode() == 'l') {
|
|
if (s[3].unicode() == 'e') {
|
|
if (s[4].unicode() == 't') {
|
|
if (s[5].unicode() == 'e') {
|
|
return Lexer::T_DELETE;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'o') {
|
|
if (s[2].unicode() == 'u') {
|
|
if (s[3].unicode() == 'b') {
|
|
if (s[4].unicode() == 'l') {
|
|
if (s[5].unicode() == 'e') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_DOUBLE) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'e') {
|
|
if (s[1].unicode() == 'x') {
|
|
if (s[2].unicode() == 'p') {
|
|
if (s[3].unicode() == 'o') {
|
|
if (s[4].unicode() == 'r') {
|
|
if (s[5].unicode() == 't') {
|
|
return Lexer::T_EXPORT;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'i') {
|
|
if (s[1].unicode() == 'm') {
|
|
if (s[2].unicode() == 'p') {
|
|
if (s[3].unicode() == 'o') {
|
|
if (s[4].unicode() == 'r') {
|
|
if (s[5].unicode() == 't') {
|
|
return Lexer::T_IMPORT;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'n') {
|
|
if (s[1].unicode() == 'a') {
|
|
if (s[2].unicode() == 't') {
|
|
if (s[3].unicode() == 'i') {
|
|
if (s[4].unicode() == 'v') {
|
|
if (s[5].unicode() == 'e') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_NATIVE) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'p') {
|
|
if (s[1].unicode() == 'u') {
|
|
if (s[2].unicode() == 'b') {
|
|
if (s[3].unicode() == 'l') {
|
|
if (s[4].unicode() == 'i') {
|
|
if (s[5].unicode() == 'c') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? Lexer::T_PUBLIC : Lexer::T_IDENTIFIER;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'r') {
|
|
if (s[2].unicode() == 'a') {
|
|
if (s[3].unicode() == 'g') {
|
|
if (s[4].unicode() == 'm') {
|
|
if (s[5].unicode() == 'a') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? Lexer::T_PRAGMA : Lexer::T_IDENTIFIER;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'r') {
|
|
if (s[1].unicode() == 'e') {
|
|
if (s[2].unicode() == 't') {
|
|
if (s[3].unicode() == 'u') {
|
|
if (s[4].unicode() == 'r') {
|
|
if (s[5].unicode() == 'n') {
|
|
return Lexer::T_RETURN;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 's') {
|
|
if ((parseModeFlags & Lexer::QmlMode) && s[1].unicode() == 'i') {
|
|
if (s[2].unicode() == 'g') {
|
|
if (s[3].unicode() == 'n') {
|
|
if (s[4].unicode() == 'a') {
|
|
if (s[5].unicode() == 'l') {
|
|
return Lexer::T_SIGNAL;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 't') {
|
|
if (s[2].unicode() == 'a') {
|
|
if (s[3].unicode() == 't') {
|
|
if (s[4].unicode() == 'i') {
|
|
if (s[5].unicode() == 'c') {
|
|
return (parseModeFlags & Lexer::StaticIsKeyword) ? int(Lexer::T_STATIC) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'w') {
|
|
if (s[2].unicode() == 'i') {
|
|
if (s[3].unicode() == 't') {
|
|
if (s[4].unicode() == 'c') {
|
|
if (s[5].unicode() == 'h') {
|
|
return Lexer::T_SWITCH;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 't') {
|
|
if (s[1].unicode() == 'h') {
|
|
if (s[2].unicode() == 'r') {
|
|
if (s[3].unicode() == 'o') {
|
|
if (s[4].unicode() == 'w') {
|
|
if (s[5].unicode() == 's') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_THROWS) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'y') {
|
|
if (s[2].unicode() == 'p') {
|
|
if (s[3].unicode() == 'e') {
|
|
if (s[4].unicode() == 'o') {
|
|
if (s[5].unicode() == 'f') {
|
|
return Lexer::T_TYPEOF;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
static inline int classify7(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 'b') {
|
|
if (s[1].unicode() == 'o') {
|
|
if (s[2].unicode() == 'o') {
|
|
if (s[3].unicode() == 'l') {
|
|
if (s[4].unicode() == 'e') {
|
|
if (s[5].unicode() == 'a') {
|
|
if (s[6].unicode() == 'n') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_BOOLEAN) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'd') {
|
|
if (s[1].unicode() == 'e') {
|
|
if (s[2].unicode() == 'f') {
|
|
if (s[3].unicode() == 'a') {
|
|
if (s[4].unicode() == 'u') {
|
|
if (s[5].unicode() == 'l') {
|
|
if (s[6].unicode() == 't') {
|
|
return Lexer::T_DEFAULT;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'e') {
|
|
if (s[1].unicode() == 'x') {
|
|
if (s[2].unicode() == 't') {
|
|
if (s[3].unicode() == 'e') {
|
|
if (s[4].unicode() == 'n') {
|
|
if (s[5].unicode() == 'd') {
|
|
if (s[6].unicode() == 's') {
|
|
return Lexer::T_EXTENDS;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'f') {
|
|
if (s[1].unicode() == 'i') {
|
|
if (s[2].unicode() == 'n') {
|
|
if (s[3].unicode() == 'a') {
|
|
if (s[4].unicode() == 'l') {
|
|
if (s[5].unicode() == 'l') {
|
|
if (s[6].unicode() == 'y') {
|
|
return Lexer::T_FINALLY;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'p') {
|
|
if (s[1].unicode() == 'a') {
|
|
if (s[2].unicode() == 'c') {
|
|
if (s[3].unicode() == 'k') {
|
|
if (s[4].unicode() == 'a') {
|
|
if (s[5].unicode() == 'g') {
|
|
if (s[6].unicode() == 'e') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_PACKAGE) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'r') {
|
|
if (s[2].unicode() == 'i') {
|
|
if (s[3].unicode() == 'v') {
|
|
if (s[4].unicode() == 'a') {
|
|
if (s[5].unicode() == 't') {
|
|
if (s[6].unicode() == 'e') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_PRIVATE) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
static inline int classify8(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 'a') {
|
|
if (s[1].unicode() == 'b') {
|
|
if (s[2].unicode() == 's') {
|
|
if (s[3].unicode() == 't') {
|
|
if (s[4].unicode() == 'r') {
|
|
if (s[5].unicode() == 'a') {
|
|
if (s[6].unicode() == 'c') {
|
|
if (s[7].unicode() == 't') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_ABSTRACT) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'c') {
|
|
if (s[1].unicode() == 'o') {
|
|
if (s[2].unicode() == 'n') {
|
|
if (s[3].unicode() == 't') {
|
|
if (s[4].unicode() == 'i') {
|
|
if (s[5].unicode() == 'n') {
|
|
if (s[6].unicode() == 'u') {
|
|
if (s[7].unicode() == 'e') {
|
|
return Lexer::T_CONTINUE;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'd') {
|
|
if (s[1].unicode() == 'e') {
|
|
if (s[2].unicode() == 'b') {
|
|
if (s[3].unicode() == 'u') {
|
|
if (s[4].unicode() == 'g') {
|
|
if (s[5].unicode() == 'g') {
|
|
if (s[6].unicode() == 'e') {
|
|
if (s[7].unicode() == 'r') {
|
|
return Lexer::T_DEBUGGER;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'f') {
|
|
if (s[1].unicode() == 'u') {
|
|
if (s[2].unicode() == 'n') {
|
|
if (s[3].unicode() == 'c') {
|
|
if (s[4].unicode() == 't') {
|
|
if (s[5].unicode() == 'i') {
|
|
if (s[6].unicode() == 'o') {
|
|
if (s[7].unicode() == 'n') {
|
|
return Lexer::T_FUNCTION;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if ((parseModeFlags & Lexer::QmlMode) && s[0].unicode() == 'p') {
|
|
if (s[1].unicode() == 'r') {
|
|
if (s[2].unicode() == 'o') {
|
|
if (s[3].unicode() == 'p') {
|
|
if (s[4].unicode() == 'e') {
|
|
if (s[5].unicode() == 'r') {
|
|
if (s[6].unicode() == 't') {
|
|
if (s[7].unicode() == 'y') {
|
|
return Lexer::T_PROPERTY;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if ((parseModeFlags & Lexer::QmlMode) && s[0].unicode() == 'r') {
|
|
if (s[1].unicode() == 'e') {
|
|
if (s[2].unicode() == 'a') {
|
|
if (s[3].unicode() == 'd') {
|
|
if (s[4].unicode() == 'o') {
|
|
if (s[5].unicode() == 'n') {
|
|
if (s[6].unicode() == 'l') {
|
|
if (s[7].unicode() == 'y') {
|
|
return Lexer::T_READONLY;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'v') {
|
|
if (s[1].unicode() == 'o') {
|
|
if (s[2].unicode() == 'l') {
|
|
if (s[3].unicode() == 'a') {
|
|
if (s[4].unicode() == 't') {
|
|
if (s[5].unicode() == 'i') {
|
|
if (s[6].unicode() == 'l') {
|
|
if (s[7].unicode() == 'e') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_VOLATILE) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
static inline int classify9(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 'i') {
|
|
if (s[1].unicode() == 'n') {
|
|
if (s[2].unicode() == 't') {
|
|
if (s[3].unicode() == 'e') {
|
|
if (s[4].unicode() == 'r') {
|
|
if (s[5].unicode() == 'f') {
|
|
if (s[6].unicode() == 'a') {
|
|
if (s[7].unicode() == 'c') {
|
|
if (s[8].unicode() == 'e') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_INTERFACE) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 'p') {
|
|
if (s[1].unicode() == 'r') {
|
|
if (s[2].unicode() == 'o') {
|
|
if (s[3].unicode() == 't') {
|
|
if (s[4].unicode() == 'e') {
|
|
if (s[5].unicode() == 'c') {
|
|
if (s[6].unicode() == 't') {
|
|
if (s[7].unicode() == 'e') {
|
|
if (s[8].unicode() == 'd') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_PROTECTED) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[0].unicode() == 't') {
|
|
if (s[1].unicode() == 'r') {
|
|
if (s[2].unicode() == 'a') {
|
|
if (s[3].unicode() == 'n') {
|
|
if (s[4].unicode() == 's') {
|
|
if (s[5].unicode() == 'i') {
|
|
if (s[6].unicode() == 'e') {
|
|
if (s[7].unicode() == 'n') {
|
|
if (s[8].unicode() == 't') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_TRANSIENT) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
static inline int classify10(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 'i') {
|
|
if (s[1].unicode() == 'm') {
|
|
if (s[2].unicode() == 'p') {
|
|
if (s[3].unicode() == 'l') {
|
|
if (s[4].unicode() == 'e') {
|
|
if (s[5].unicode() == 'm') {
|
|
if (s[6].unicode() == 'e') {
|
|
if (s[7].unicode() == 'n') {
|
|
if (s[8].unicode() == 't') {
|
|
if (s[9].unicode() == 's') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_IMPLEMENTS) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
else if (s[1].unicode() == 'n') {
|
|
if (s[2].unicode() == 's') {
|
|
if (s[3].unicode() == 't') {
|
|
if (s[4].unicode() == 'a') {
|
|
if (s[5].unicode() == 'n') {
|
|
if (s[6].unicode() == 'c') {
|
|
if (s[7].unicode() == 'e') {
|
|
if (s[8].unicode() == 'o') {
|
|
if (s[9].unicode() == 'f') {
|
|
return Lexer::T_INSTANCEOF;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
static inline int classify12(const QChar *s, int parseModeFlags) {
|
|
if (s[0].unicode() == 's') {
|
|
if (s[1].unicode() == 'y') {
|
|
if (s[2].unicode() == 'n') {
|
|
if (s[3].unicode() == 'c') {
|
|
if (s[4].unicode() == 'h') {
|
|
if (s[5].unicode() == 'r') {
|
|
if (s[6].unicode() == 'o') {
|
|
if (s[7].unicode() == 'n') {
|
|
if (s[8].unicode() == 'i') {
|
|
if (s[9].unicode() == 'z') {
|
|
if (s[10].unicode() == 'e') {
|
|
if (s[11].unicode() == 'd') {
|
|
return (parseModeFlags & Lexer::QmlMode) ? int(Lexer::T_SYNCHRONIZED) : int(Lexer::T_IDENTIFIER);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return Lexer::T_IDENTIFIER;
|
|
}
|
|
|
|
int Lexer::classify(const QChar *s, int n, int parseModeFlags) {
|
|
switch (n) {
|
|
case 2: return classify2(s, parseModeFlags);
|
|
case 3: return classify3(s, parseModeFlags);
|
|
case 4: return classify4(s, parseModeFlags);
|
|
case 5: return classify5(s, parseModeFlags);
|
|
case 6: return classify6(s, parseModeFlags);
|
|
case 7: return classify7(s, parseModeFlags);
|
|
case 8: return classify8(s, parseModeFlags);
|
|
case 9: return classify9(s, parseModeFlags);
|
|
case 10: return classify10(s, parseModeFlags);
|
|
case 12: return classify12(s, parseModeFlags);
|
|
default: return Lexer::T_IDENTIFIER;
|
|
} // switch
|
|
}
|
|
|
|
} // namespace QmlJS
|
|
|
|
QT_QML_END_NAMESPACE
|
|
|