feedc0de/qt-creator
1
0
Fork 0
forked from qt-creator/qt-creator
Code Pull Requests Activity
Files
40725cfd6db30ccb06239a3fb04de80f1e8d276e
qt-creator/src/shared/cplusplus/Keywords.cpp

1648 lines
36 KiB
C++
Raw Normal View History

Fixes: change file license headers to include LGPL
2009-02-25 09:15:00 +01:00
/**************************************************************************
Initial import
2008-12-02 12:01:29 +01:00
**
** This file is part of Qt Creator
**
Long live the king!
2010-03-05 11:25:49 +01:00
** Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies).
Initial import
2008-12-02 12:01:29 +01:00
**
Update license headers and sales contact details. Reviewed-by: Trust Me
2009-06-17 00:01:27 +10:00
** Contact: Nokia Corporation (qt-info@nokia.com)
Initial import
2008-12-02 12:01:29 +01:00
**
License headers.
2010-12-17 16:01:08 +01:00
** No Commercial Usage
end-of-line whitespace correction of the new headers
2008-12-02 14:17:16 +01:00
**
License headers.
2010-12-17 16:01:08 +01:00
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
end-of-line whitespace correction of the new headers
2008-12-02 14:17:16 +01:00
**
Fixes: change file license headers to include LGPL
2009-02-25 09:15:00 +01:00
** GNU Lesser General Public License Usage
end-of-line whitespace correction of the new headers
2008-12-02 14:17:16 +01:00
**
Fixes: change file license headers to include LGPL
2009-02-25 09:15:00 +01:00
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
end-of-line whitespace correction of the new headers
2008-12-02 14:17:16 +01:00
**
License headers.
2010-12-17 16:01:08 +01:00
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
Initial import
2008-12-02 12:01:29 +01:00
**
Fixes: change file license headers to include LGPL
2009-02-25 09:15:00 +01:00
**************************************************************************/
Initial import
2008-12-02 12:01:29 +01:00
// Copyright (c) 2008 Roberto Raggi <roberto.raggi@gmail.com>
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall 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.
#include "Lexer.h"
#include "Token.h"
Cleanup the C++ front-end. Removed CPLUSPLUS_BEGIN/END_NAMESPACE & co and made it possible to compile the parser with CPLUSPLUS_WITHOUT_QT.
2009-10-20 11:21:25 +02:00
using namespace CPlusPlus;
Initial import
2008-12-02 12:01:29 +01:00
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify2(const char *s, bool, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == 'd') {
if (s[1] == 'o') {
return T_DO;
}
}
else if (s[0] == 'i') {
if (s[1] == 'f') {
return T_IF;
}
}
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify3(const char *s, bool q, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == 'a') {
if (s[1] == 's') {
if (s[2] == 'm') {
return T_ASM;
}
}
}
else if (s[0] == 'f') {
if (s[1] == 'o') {
if (s[2] == 'r') {
return T_FOR;
}
}
}
else if (s[0] == 'i') {
if (s[1] == 'n') {
if (s[2] == 't') {
return T_INT;
}
}
}
else if (s[0] == 'n') {
if (s[1] == 'e') {
if (s[2] == 'w') {
return T_NEW;
}
}
}
else if (s[0] == 't') {
if (s[1] == 'r') {
if (s[2] == 'y') {
return T_TRY;
}
}
}
Inital support for Q_D/Q_Q declarations.
2009-11-30 16:30:21 +01:00
else if (q && s[0] == 'Q') {
if (s[1] == '_') {
if (s[2] == 'D') {
return T_Q_D;
}
else if (s[2] == 'Q') {
return T_Q_Q;
}
}
}
Initial import
2008-12-02 12:01:29 +01:00
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify4(const char *s, bool q, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == 'a') {
if (s[1] == 'u') {
if (s[2] == 't') {
if (s[3] == 'o') {
return T_AUTO;
}
}
}
}
else if (s[0] == 'b') {
if (s[1] == 'o') {
if (s[2] == 'o') {
if (s[3] == 'l') {
return T_BOOL;
}
}
}
}
else if (s[0] == 'c') {
if (s[1] == 'a') {
if (s[2] == 's') {
if (s[3] == 'e') {
return T_CASE;
}
}
}
else if (s[1] == 'h') {
if (s[2] == 'a') {
if (s[3] == 'r') {
return T_CHAR;
}
}
}
}
else if (s[0] == 'e') {
if (s[1] == 'l') {
if (s[2] == 's') {
if (s[3] == 'e') {
return T_ELSE;
}
}
}
else if (s[1] == 'n') {
if (s[2] == 'u') {
if (s[3] == 'm') {
return T_ENUM;
}
}
}
}
else if (s[0] == 'g') {
if (s[1] == 'o') {
if (s[2] == 't') {
if (s[3] == 'o') {
return T_GOTO;
}
}
}
}
else if (s[0] == 'l') {
if (s[1] == 'o') {
if (s[2] == 'n') {
if (s[3] == 'g') {
return T_LONG;
}
}
}
}
else if (s[0] == 't') {
if (s[1] == 'h') {
if (s[2] == 'i') {
if (s[3] == 's') {
return T_THIS;
}
}
}
else if (s[1] == 'r') {
if (s[2] == 'u') {
if (s[3] == 'e') {
return T_TRUE;
}
}
}
}
else if (s[0] == 'v') {
if (s[1] == 'o') {
if (s[2] == 'i') {
if (s[3] == 'd') {
return T_VOID;
}
}
}
}
else if (q && s[0] == 'S') {
if (s[1] == 'L') {
if (s[2] == 'O') {
if (s[3] == 'T') {
return T_SLOT;
}
}
}
}
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify5(const char *s, bool q, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == '_') {
if (s[1] == '_') {
if (s[2] == 'a') {
if (s[3] == 's') {
if (s[4] == 'm') {
return T___ASM;
}
}
}
}
}
else if (s[0] == 'b') {
if (s[1] == 'r') {
if (s[2] == 'e') {
if (s[3] == 'a') {
if (s[4] == 'k') {
return T_BREAK;
}
}
}
}
}
else if (s[0] == 'c') {
if (s[1] == 'a') {
if (s[2] == 't') {
if (s[3] == 'c') {
if (s[4] == 'h') {
return T_CATCH;
}
}
}
}
else if (s[1] == 'l') {
if (s[2] == 'a') {
if (s[3] == 's') {
if (s[4] == 's') {
return T_CLASS;
}
}
}
}
else if (s[1] == 'o') {
if (s[2] == 'n') {
if (s[3] == 's') {
if (s[4] == 't') {
return T_CONST;
}
}
}
}
}
else if (s[0] == 'f') {
if (s[1] == 'a') {
if (s[2] == 'l') {
if (s[3] == 's') {
if (s[4] == 'e') {
return T_FALSE;
}
}
}
}
else if (s[1] == 'l') {
if (s[2] == 'o') {
if (s[3] == 'a') {
if (s[4] == 't') {
return T_FLOAT;
}
}
}
}
}
else if (s[0] == 's') {
if (s[1] == 'h') {
if (s[2] == 'o') {
if (s[3] == 'r') {
if (s[4] == 't') {
return T_SHORT;
}
}
}
}
else if (q) {
if (s[1] == 'l') {
if (s[2] == 'o') {
if (s[3] == 't') {
if (s[4] == 's') {
Introduced ForeachStatementAST and the bits to parse foreach statements when qtMocRun is enabled.
2009-07-03 09:11:52 +02:00
return T_Q_SLOTS;
Initial import
2008-12-02 12:01:29 +01:00
}
}
}
}
}
}
else if (s[0] == 't') {
if (s[1] == 'h') {
if (s[2] == 'r') {
if (s[3] == 'o') {
if (s[4] == 'w') {
return T_THROW;
}
}
}
}
}
else if (s[0] == 'u') {
if (s[1] == 'n') {
if (s[2] == 'i') {
if (s[3] == 'o') {
if (s[4] == 'n') {
return T_UNION;
}
}
}
}
else if (s[1] == 's') {
if (s[2] == 'i') {
if (s[3] == 'n') {
if (s[4] == 'g') {
return T_USING;
}
}
}
}
}
else if (s[0] == 'w') {
if (s[1] == 'h') {
if (s[2] == 'i') {
if (s[3] == 'l') {
if (s[4] == 'e') {
return T_WHILE;
}
}
}
}
}
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify6(const char *s, bool q, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == 'd') {
if (s[1] == 'e') {
if (s[2] == 'l') {
if (s[3] == 'e') {
if (s[4] == 't') {
if (s[5] == 'e') {
return T_DELETE;
}
}
}
}
}
else if (s[1] == 'o') {
if (s[2] == 'u') {
if (s[3] == 'b') {
if (s[4] == 'l') {
if (s[5] == 'e') {
return T_DOUBLE;
}
}
}
}
}
}
else if (s[0] == 'e') {
if (s[1] == 'x') {
if (s[2] == 'p') {
if (s[3] == 'o') {
if (s[4] == 'r') {
if (s[5] == 't') {
return T_EXPORT;
}
}
}
}
else if (s[2] == 't') {
if (s[3] == 'e') {
if (s[4] == 'r') {
if (s[5] == 'n') {
return T_EXTERN;
}
}
}
}
}
}
else if (s[0] == 'f') {
if (s[1] == 'r') {
if (s[2] == 'i') {
if (s[3] == 'e') {
if (s[4] == 'n') {
if (s[5] == 'd') {
return T_FRIEND;
}
}
}
}
}
}
else if (s[0] == 'i') {
if (s[1] == 'n') {
if (s[2] == 'l') {
if (s[3] == 'i') {
if (s[4] == 'n') {
if (s[5] == 'e') {
return T_INLINE;
}
}
}
}
}
}
else if (s[0] == 'p') {
if (s[1] == 'u') {
if (s[2] == 'b') {
if (s[3] == 'l') {
if (s[4] == 'i') {
if (s[5] == 'c') {
return T_PUBLIC;
}
}
}
}
}
}
else if (s[0] == 'r') {
if (s[1] == 'e') {
if (s[2] == 't') {
if (s[3] == 'u') {
if (s[4] == 'r') {
if (s[5] == 'n') {
return T_RETURN;
}
}
}
}
}
}
else if (s[0] == 's') {
if (s[1] == 'i') {
if (s[2] == 'g') {
if (s[3] == 'n') {
if (s[4] == 'e') {
if (s[5] == 'd') {
return T_SIGNED;
}
}
}
}
else if (s[2] == 'z') {
if (s[3] == 'e') {
if (s[4] == 'o') {
if (s[5] == 'f') {
return T_SIZEOF;
}
}
}
}
}
else if (s[1] == 't') {
if (s[2] == 'a') {
if (s[3] == 't') {
if (s[4] == 'i') {
if (s[5] == 'c') {
return T_STATIC;
}
}
}
}
else if (s[2] == 'r') {
if (s[3] == 'u') {
if (s[4] == 'c') {
if (s[5] == 't') {
return T_STRUCT;
}
}
}
}
}
else if (s[1] == 'w') {
if (s[2] == 'i') {
if (s[3] == 't') {
if (s[4] == 'c') {
if (s[5] == 'h') {
return T_SWITCH;
}
}
}
}
}
}
else if (s[0] == 't') {
if (s[1] == 'y') {
if (s[2] == 'p') {
if (s[3] == 'e') {
if (s[4] == 'i') {
if (s[5] == 'd') {
return T_TYPEID;
}
}
else if (s[4] == 'o') {
if (s[5] == 'f') {
return T_TYPEOF;
}
}
}
}
}
}
else if (q && s[0] == 'S') {
if (s[1] == 'I') {
if (s[2] == 'G') {
if (s[3] == 'N') {
if (s[4] == 'A') {
if (s[5] == 'L') {
return T_SIGNAL;
}
}
}
}
}
}
Added support for Q_SIGNAL and Q_SLOT.
2009-03-25 11:50:17 +01:00
else if (q && s[0] == 'Q') {
if (s[1] == '_') {
if (s[2] == 'S') {
if (s[3] == 'L') {
if (s[4] == 'O') {
if (s[5] == 'T') {
return T_Q_SLOT;
}
}
}
}
}
}
Initial import
2008-12-02 12:01:29 +01:00
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify7(const char *s, bool q, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == '_') {
if (s[1] == '_') {
if (s[2] == 'a') {
if (s[3] == 's') {
if (s[4] == 'm') {
if (s[5] == '_') {
if (s[6] == '_') {
return T___ASM__;
}
}
}
}
}
else if (s[2] == 'c') {
if (s[3] == 'o') {
if (s[4] == 'n') {
if (s[5] == 's') {
if (s[6] == 't') {
return T___CONST;
}
}
}
}
}
}
}
else if (s[0] == 'd') {
if (s[1] == 'e') {
if (s[2] == 'f') {
if (s[3] == 'a') {
if (s[4] == 'u') {
if (s[5] == 'l') {
if (s[6] == 't') {
return T_DEFAULT;
}
}
}
}
}
}
}
else if (s[0] == 'm') {
if (s[1] == 'u') {
if (s[2] == 't') {
if (s[3] == 'a') {
if (s[4] == 'b') {
if (s[5] == 'l') {
if (s[6] == 'e') {
return T_MUTABLE;
}
}
}
}
}
}
}
else if (s[0] == 'p') {
if (s[1] == 'r') {
if (s[2] == 'i') {
if (s[3] == 'v') {
if (s[4] == 'a') {
if (s[5] == 't') {
if (s[6] == 'e') {
return T_PRIVATE;
}
}
}
}
}
}
}
Made foreach a keyword when parsing with qtMocRun
2009-07-03 11:00:36 +02:00
else if (q && s[0] == 'f') {
if (s[1] == 'o') {
if (s[2] == 'r') {
if (s[3] == 'e') {
if (s[4] == 'a') {
if (s[5] == 'c') {
if (s[6] == 'h') {
return T_Q_FOREACH;
}
}
}
}
}
}
}
Initial import
2008-12-02 12:01:29 +01:00
else if (q && s[0] == 's') {
if (s[1] == 'i') {
if (s[2] == 'g') {
if (s[3] == 'n') {
if (s[4] == 'a') {
if (s[5] == 'l') {
if (s[6] == 's') {
Introduced ForeachStatementAST and the bits to parse foreach statements when qtMocRun is enabled.
2009-07-03 09:11:52 +02:00
return T_Q_SIGNALS;
Initial import
2008-12-02 12:01:29 +01:00
}
}
}
}
}
}
}
else if (s[0] == 't') {
if (s[1] == 'y') {
if (s[2] == 'p') {
if (s[3] == 'e') {
if (s[4] == 'd') {
if (s[5] == 'e') {
if (s[6] == 'f') {
return T_TYPEDEF;
}
}
}
}
}
}
}
else if (s[0] == 'v') {
if (s[1] == 'i') {
if (s[2] == 'r') {
if (s[3] == 't') {
if (s[4] == 'u') {
if (s[5] == 'a') {
if (s[6] == 'l') {
return T_VIRTUAL;
}
}
}
}
}
}
}
else if (s[0] == 'w') {
if (s[1] == 'c') {
if (s[2] == 'h') {
if (s[3] == 'a') {
if (s[4] == 'r') {
if (s[5] == '_') {
if (s[6] == 't') {
return T_WCHAR_T;
}
}
}
}
}
}
}
else if (q && s[0] == 'Q') {
if (s[1] == '_') {
if (s[2] == 'S') {
if (s[3] == 'L') {
if (s[4] == 'O') {
if (s[5] == 'T') {
if (s[6] == 'S') {
Introduced ForeachStatementAST and the bits to parse foreach statements when qtMocRun is enabled.
2009-07-03 09:11:52 +02:00
return T_Q_SLOTS;
Initial import
2008-12-02 12:01:29 +01:00
}
}
}
}
}
Merge ichecker branch changes into the mainline. New project can be found under src/tools/ICheck
2010-01-19 15:26:08 +10:00
else if (s[2] == 'E') {
if (s[3] == 'N') {
if (s[4] == 'U') {
if (s[5] == 'M') {
if (s[6] == 'S') {
return T_Q_ENUMS;
}
}
}
}
}
else if (s[2] == 'F') {
if (s[3] == 'L') {
if (s[4] == 'A') {
if (s[5] == 'G') {
if (s[6] == 'S') {
return T_Q_FLAGS;
}
}
}
}
}
Initial import
2008-12-02 12:01:29 +01:00
}
}
return T_IDENTIFIER;
}
Recognize C++0x decltype.
2010-03-24 13:43:38 +01:00
static inline int classify8(const char *s, bool q, bool x) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == '_') {
if (s[1] == '_') {
if (s[2] == 'i') {
if (s[3] == 'n') {
if (s[4] == 'l') {
if (s[5] == 'i') {
if (s[6] == 'n') {
if (s[7] == 'e') {
return T___INLINE;
}
}
}
}
}
}
else if (s[2] == 't') {
if (s[3] == 'y') {
if (s[4] == 'p') {
if (s[5] == 'e') {
if (s[6] == 'o') {
if (s[7] == 'f') {
return T___TYPEOF;
}
}
}
}
}
}
}
}
else if (s[0] == 'c') {
if (s[1] == 'o') {
if (s[2] == 'n') {
if (s[3] == 't') {
if (s[4] == 'i') {
if (s[5] == 'n') {
if (s[6] == 'u') {
if (s[7] == 'e') {
return T_CONTINUE;
}
}
}
}
}
}
}
}
Recognize C++0x decltype.
2010-03-24 13:43:38 +01:00
else if (x && s[0] == 'd') {
if (s[1] == 'e') {
if (s[2] == 'c') {
if (s[3] == 'l') {
if (s[4] == 't') {
if (s[5] == 'y') {
if (s[6] == 'p') {
if (s[7] == 'e') {
return T___TYPEOF;
}
}
}
}
}
}
}
}
Initial import
2008-12-02 12:01:29 +01:00
else if (s[0] == 'e') {
if (s[1] == 'x') {
if (s[2] == 'p') {
if (s[3] == 'l') {
if (s[4] == 'i') {
if (s[5] == 'c') {
if (s[6] == 'i') {
if (s[7] == 't') {
return T_EXPLICIT;
}
}
}
}
}
}
}
}
else if (s[0] == 'o') {
if (s[1] == 'p') {
if (s[2] == 'e') {
if (s[3] == 'r') {
if (s[4] == 'a') {
if (s[5] == 't') {
if (s[6] == 'o') {
if (s[7] == 'r') {
return T_OPERATOR;
}
}
}
}
}
}
}
}
else if (s[0] == 'r') {
if (s[1] == 'e') {
if (s[2] == 'g') {
if (s[3] == 'i') {
if (s[4] == 's') {
if (s[5] == 't') {
if (s[6] == 'e') {
if (s[7] == 'r') {
return T_REGISTER;
}
}
}
}
}
}
}
}
else if (s[0] == 't') {
if (s[1] == 'e') {
if (s[2] == 'm') {
if (s[3] == 'p') {
if (s[4] == 'l') {
if (s[5] == 'a') {
if (s[6] == 't') {
if (s[7] == 'e') {
return T_TEMPLATE;
}
}
}
}
}
}
}
else if (s[1] == 'y') {
if (s[2] == 'p') {
if (s[3] == 'e') {
if (s[4] == 'n') {
if (s[5] == 'a') {
if (s[6] == 'm') {
if (s[7] == 'e') {
return T_TYPENAME;
}
}
}
}
}
}
}
}
else if (s[0] == 'u') {
if (s[1] == 'n') {
if (s[2] == 's') {
if (s[3] == 'i') {
if (s[4] == 'g') {
if (s[5] == 'n') {
if (s[6] == 'e') {
if (s[7] == 'd') {
return T_UNSIGNED;
}
}
}
}
}
}
}
}
else if (s[0] == 'v') {
if (s[1] == 'o') {
if (s[2] == 'l') {
if (s[3] == 'a') {
if (s[4] == 't') {
if (s[5] == 'i') {
if (s[6] == 'l') {
if (s[7] == 'e') {
return T_VOLATILE;
}
}
}
}
}
}
}
}
Fixed pre-processor handling for Q_PROPERTY, Q_ENUMS and Q_FLAGS.
2010-02-22 13:11:09 +01:00
else if (q && s[0] == 'Q') {
Added support for Q_SIGNAL and Q_SLOT.
2009-03-25 11:50:17 +01:00
if (s[1] == '_') {
Parse and create AST nodes for the Q_MOC_RUN extensions.
2010-03-17 14:35:48 +01:00
if (s[2] == 'G') {
if (s[3] == 'A') {
if (s[4] == 'D') {
if (s[5] == 'G') {
if (s[6] == 'E') {
if (s[7] == 'T') {
return T_Q_GADGET;
}
}
}
}
}
}
else if (s[2] == 'O') {
if (s[3] == 'B') {
if (s[4] == 'J') {
if (s[5] == 'E') {
if (s[6] == 'C') {
if (s[7] == 'T') {
return T_Q_OBJECT;
}
}
}
}
}
}
else if (s[2] == 'S') {
Added support for Q_SIGNAL and Q_SLOT.
2009-03-25 11:50:17 +01:00
if (s[3] == 'I') {
if (s[4] == 'G') {
if (s[5] == 'N') {
if (s[6] == 'A') {
if (s[7] == 'L') {
return T_Q_SIGNAL;
}
}
}
}
}
}
}
}
Initial import
2008-12-02 12:01:29 +01:00
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify9(const char *s, bool q, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == '_') {
if (s[1] == '_') {
if (s[2] == 'c') {
if (s[3] == 'o') {
if (s[4] == 'n') {
if (s[5] == 's') {
if (s[6] == 't') {
if (s[7] == '_') {
if (s[8] == '_') {
return T___CONST__;
}
}
}
}
}
}
}
}
}
else if (s[0] == 'n') {
if (s[1] == 'a') {
if (s[2] == 'm') {
if (s[3] == 'e') {
if (s[4] == 's') {
if (s[5] == 'p') {
if (s[6] == 'a') {
if (s[7] == 'c') {
if (s[8] == 'e') {
return T_NAMESPACE;
}
}
}
}
}
}
}
}
}
else if (s[0] == 'p') {
if (s[1] == 'r') {
if (s[2] == 'o') {
if (s[3] == 't') {
if (s[4] == 'e') {
if (s[5] == 'c') {
if (s[6] == 't') {
if (s[7] == 'e') {
if (s[8] == 'd') {
return T_PROTECTED;
}
}
}
}
}
}
}
}
}
else if (q && s[0] == 'Q') {
if (s[1] == '_') {
if (s[2] == 'S') {
if (s[3] == 'I') {
if (s[4] == 'G') {
if (s[5] == 'N') {
if (s[6] == 'A') {
if (s[7] == 'L') {
if (s[8] == 'S') {
Introduced ForeachStatementAST and the bits to parse foreach statements when qtMocRun is enabled.
2009-07-03 09:11:52 +02:00
return T_Q_SIGNALS;
}
}
}
}
}
}
} else if (s[2] == 'F') {
if (s[3] == 'O') {
if (s[4] == 'R') {
if (s[5] == 'E') {
if (s[6] == 'A') {
if (s[7] == 'C') {
if (s[8] == 'H') {
return T_Q_FOREACH;
Initial import
2008-12-02 12:01:29 +01:00
}
}
}
}
}
}
}
}
}
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify10(const char *s, bool q, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == '_') {
if (s[1] == '_') {
if (s[2] == 'i') {
if (s[3] == 'n') {
if (s[4] == 'l') {
if (s[5] == 'i') {
if (s[6] == 'n') {
if (s[7] == 'e') {
if (s[8] == '_') {
if (s[9] == '_') {
return T___INLINE__;
}
}
}
}
}
}
}
}
else if (s[2] == 't') {
if (s[3] == 'y') {
if (s[4] == 'p') {
if (s[5] == 'e') {
if (s[6] == 'o') {
if (s[7] == 'f') {
if (s[8] == '_') {
if (s[9] == '_') {
return T___TYPEOF__;
}
}
}
}
}
}
}
}
else if (s[2] == 'v') {
if (s[3] == 'o') {
if (s[4] == 'l') {
if (s[5] == 'a') {
if (s[6] == 't') {
if (s[7] == 'i') {
if (s[8] == 'l') {
if (s[9] == 'e') {
return T___VOLATILE;
}
}
}
}
}
}
}
}
}
}
else if (s[0] == 'c') {
if (s[1] == 'o') {
if (s[2] == 'n') {
if (s[3] == 's') {
if (s[4] == 't') {
if (s[5] == '_') {
if (s[6] == 'c') {
if (s[7] == 'a') {
if (s[8] == 's') {
if (s[9] == 't') {
return T_CONST_CAST;
}
}
}
}
}
}
}
}
}
}
Fixed pre-processor handling for Q_PROPERTY, Q_ENUMS and Q_FLAGS.
2010-02-22 13:11:09 +01:00
else if (q && s[0] == 'Q') {
Merge ichecker branch changes into the mainline. New project can be found under src/tools/ICheck
2010-01-19 15:26:08 +10:00
if (s[1] == '_') {
Parse and create AST nodes for the Q_MOC_RUN extensions.
2010-03-17 14:35:48 +01:00
if (s[2] == 'O') {
if (s[3] == 'V') {
if (s[4] == 'E') {
if (s[5] == 'R') {
if (s[6] == 'R') {
if (s[7] == 'I') {
if (s[8] == 'D') {
if (s[9] == 'E') {
return T_Q_PROPERTY; // Q_OVERRIDE is just an alias for Q_PROPERTY
}
}
}
}
}
}
}
}
else if (s[2] == 'P') {
Merge ichecker branch changes into the mainline. New project can be found under src/tools/ICheck
2010-01-19 15:26:08 +10:00
if (s[3] == 'R') {
if (s[4] == 'O') {
if (s[5] == 'P') {
if (s[6] == 'E') {
if (s[7] == 'R') {
if (s[8] == 'T') {
if (s[9] == 'Y') {
return T_Q_PROPERTY;
}
}
}
}
}
}
}
}
}
}
Initial import
2008-12-02 12:01:29 +01:00
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify11(const char *s, bool q, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == '_') {
if (s[1] == '_') {
if (s[2] == 'a') {
if (s[3] == 't') {
if (s[4] == 't') {
if (s[5] == 'r') {
if (s[6] == 'i') {
if (s[7] == 'b') {
if (s[8] == 'u') {
if (s[9] == 't') {
if (s[10] == 'e') {
return T___ATTRIBUTE;
}
}
}
}
}
}
}
}
}
}
}
else if (s[0] == 's') {
if (s[1] == 't') {
if (s[2] == 'a') {
if (s[3] == 't') {
if (s[4] == 'i') {
if (s[5] == 'c') {
if (s[6] == '_') {
if (s[7] == 'c') {
if (s[8] == 'a') {
if (s[9] == 's') {
if (s[10] == 't') {
return T_STATIC_CAST;
}
}
}
}
}
}
}
}
}
}
}
Fixed pre-processor handling for Q_PROPERTY, Q_ENUMS and Q_FLAGS.
2010-02-22 13:11:09 +01:00
else if (q && s[0] == 'Q') {
Merge ichecker branch changes into the mainline. New project can be found under src/tools/ICheck
2010-01-19 15:26:08 +10:00
if (s[1] == '_') {
if (s[2] == 'I') {
if (s[3] == 'N') {
if (s[4] == 'V') {
if (s[5] == 'O') {
if (s[6] == 'K') {
if (s[7] == 'A') {
if (s[8] == 'B') {
if (s[9] == 'L') {
if (s[10] == 'E') {
return T_Q_INVOKABLE;
}
}
}
}
}
}
}
}
}
}
}
Initial import
2008-12-02 12:01:29 +01:00
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify12(const char *s, bool q, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == '_') {
if (s[1] == '_') {
if (s[2] == 'v') {
if (s[3] == 'o') {
if (s[4] == 'l') {
if (s[5] == 'a') {
if (s[6] == 't') {
if (s[7] == 'i') {
if (s[8] == 'l') {
if (s[9] == 'e') {
if (s[10] == '_') {
if (s[11] == '_') {
return T___VOLATILE__;
}
}
}
}
}
}
}
}
}
}
}
}
Added parser support for Q_INTERFACES.
2010-03-16 17:29:40 +01:00
else if (q && s[0] == 'Q') {
if (s[1] == '_') {
if (s[2] == 'I') {
if (s[3] == 'N') {
if (s[4] == 'T') {
if (s[5] == 'E') {
if (s[6] == 'R') {
if (s[7] == 'F') {
if (s[8] == 'A') {
if (s[9] == 'C') {
if (s[10] == 'E') {
if (s[11] == 'S') {
return T_Q_INTERFACES;
}
}
}
}
}
}
}
}
}
}
}
}
Initial import
2008-12-02 12:01:29 +01:00
else if (s[0] == 'd') {
if (s[1] == 'y') {
if (s[2] == 'n') {
if (s[3] == 'a') {
if (s[4] == 'm') {
if (s[5] == 'i') {
if (s[6] == 'c') {
if (s[7] == '_') {
if (s[8] == 'c') {
if (s[9] == 'a') {
if (s[10] == 's') {
if (s[11] == 't') {
return T_DYNAMIC_CAST;
}
}
}
}
}
}
}
}
}
}
}
}
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify13(const char *s, bool, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == '_') {
if (s[1] == '_') {
if (s[2] == 'a') {
if (s[3] == 't') {
if (s[4] == 't') {
if (s[5] == 'r') {
if (s[6] == 'i') {
if (s[7] == 'b') {
if (s[8] == 'u') {
if (s[9] == 't') {
if (s[10] == 'e') {
if (s[11] == '_') {
if (s[12] == '_') {
return T___ATTRIBUTE__;
}
}
}
}
}
}
}
}
}
}
}
}
}
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify16(const char *s, bool, bool) {
Initial import
2008-12-02 12:01:29 +01:00
if (s[0] == 'r') {
if (s[1] == 'e') {
if (s[2] == 'i') {
if (s[3] == 'n') {
if (s[4] == 't') {
if (s[5] == 'e') {
if (s[6] == 'r') {
if (s[7] == 'p') {
if (s[8] == 'r') {
if (s[9] == 'e') {
if (s[10] == 't') {
if (s[11] == '_') {
if (s[12] == 'c') {
if (s[13] == 'a') {
if (s[14] == 's') {
if (s[15] == 't') {
return T_REINTERPRET_CAST;
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify14(const char *s, bool q, bool) {
Parse and create AST nodes for the Q_MOC_RUN extensions.
2010-03-17 14:35:48 +01:00
if (q && s[0] == 'Q') {
if (s[1] == '_') {
if (s[2] == 'P') {
if (s[3] == 'R') {
if (s[4] == 'I') {
if (s[5] == 'V') {
if (s[6] == 'A') {
if (s[7] == 'T') {
if (s[8] == 'E') {
if (s[9] == '_') {
if (s[10] == 'S') {
if (s[11] == 'L') {
if (s[12] == 'O') {
if (s[13] == 'T') {
return T_Q_PRIVATE_SLOT;
}
}
}
}
}
}
}
}
}
}
}
}
}
}
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
static inline int classify19(const char *s, bool q, bool) {
Parse and create AST nodes for the Q_MOC_RUN extensions.
2010-03-17 14:35:48 +01:00
if (q && s[0] == 'Q') {
if (s[1] == '_') {
if (s[2] == 'D') {
if (s[3] == 'E') {
if (s[4] == 'C') {
if (s[5] == 'L') {
if (s[6] == 'A') {
if (s[7] == 'R') {
if (s[8] == 'E') {
if (s[9] == '_') {
if (s[10] == 'I') {
if (s[11] == 'N') {
if (s[12] == 'T') {
if (s[13] == 'E') {
if (s[14] == 'R') {
if (s[15] == 'F') {
if (s[16] == 'A') {
if (s[17] == 'C') {
if (s[18] == 'E') {
return T_Q_DECLARE_INTERFACE;
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
}
return T_IDENTIFIER;
}
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
int Lexer::classify(const char *s, int n, bool q, bool x) {
Initial import
2008-12-02 12:01:29 +01:00
switch (n) {
Recognize C++0x lambda expressions.
2010-03-24 12:54:25 +01:00
case 2: return classify2(s, q, x);
case 3: return classify3(s, q, x);
case 4: return classify4(s, q, x);
case 5: return classify5(s, q, x);
case 6: return classify6(s, q, x);
case 7: return classify7(s, q, x);
case 8: return classify8(s, q, x);
case 9: return classify9(s, q, x);
case 10: return classify10(s, q, x);
case 11: return classify11(s, q, x);
case 12: return classify12(s, q, x);
case 13: return classify13(s, q, x);
case 14: return classify14(s, q, x);
case 16: return classify16(s, q, x);
case 19: return classify19(s, q, x);
Initial import
2008-12-02 12:01:29 +01:00
default: return T_IDENTIFIER;
} // switch
}
Implemented support for C++ and iso646 operators.
2008-12-10 13:27:59 +01:00
static inline int classifyOperator2(const char *s) {
if (s[0] == 'o') {
if (s[1] == 'r') {
return T_OR;
}
}
return T_IDENTIFIER;
}
static inline int classifyOperator3(const char *s) {
if (s[0] == 'a') {
if (s[1] == 'n') {
if (s[2] == 'd') {
return T_AND;
}
}
}
else if (s[0] == 'n') {
if (s[1] == 'o') {
if (s[2] == 't') {
return T_NOT;
}
}
}
else if (s[0] == 'x') {
if (s[1] == 'o') {
if (s[2] == 'r') {
return T_XOR;
}
}
}
return T_IDENTIFIER;
}
static inline int classifyOperator5(const char *s) {
if (s[0] == 'b') {
if (s[1] == 'i') {
if (s[2] == 't') {
if (s[3] == 'o') {
if (s[4] == 'r') {
return T_BITOR;
}
}
}
}
}
else if (s[0] == 'c') {
if (s[1] == 'o') {
if (s[2] == 'm') {
if (s[3] == 'p') {
if (s[4] == 'l') {
return T_COMPL;
}
}
}
}
}
else if (s[0] == 'o') {
if (s[1] == 'r') {
if (s[2] == '_') {
if (s[3] == 'e') {
if (s[4] == 'q') {
return T_OR_EQ;
}
}
}
}
}
return T_IDENTIFIER;
}
static inline int classifyOperator6(const char *s) {
if (s[0] == 'a') {
if (s[1] == 'n') {
if (s[2] == 'd') {
if (s[3] == '_') {
if (s[4] == 'e') {
if (s[5] == 'q') {
return T_AND_EQ;
}
}
}
}
}
}
else if (s[0] == 'b') {
if (s[1] == 'i') {
if (s[2] == 't') {
if (s[3] == 'a') {
if (s[4] == 'n') {
if (s[5] == 'd') {
return T_BITAND;
}
}
}
}
}
}
else if (s[0] == 'n') {
if (s[1] == 'o') {
if (s[2] == 't') {
if (s[3] == '_') {
if (s[4] == 'e') {
if (s[5] == 'q') {
return T_NOT_EQ;
}
}
}
}
}
}
else if (s[0] == 'x') {
if (s[1] == 'o') {
if (s[2] == 'r') {
if (s[3] == '_') {
if (s[4] == 'e') {
if (s[5] == 'q') {
return T_XOR_EQ;
}
}
}
}
}
}
return T_IDENTIFIER;
}
int Lexer::classifyOperator(const char *s, int n) {
switch (n) {
case 2: return classifyOperator2(s);
case 3: return classifyOperator3(s);
case 5: return classifyOperator5(s);
case 6: return classifyOperator6(s);
default: return T_IDENTIFIER;
} // switch
}
Cleanup the C++ front-end. Removed CPLUSPLUS_BEGIN/END_NAMESPACE & co and made it possible to compile the parser with CPLUSPLUS_WITHOUT_QT.
2009-10-20 11:21:25 +02:00
Copy Permalink