1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
// -*- c-basic-offset: 4 -*-
/*
* This file is part of the KDE libraries
* Copyright (C) 1999-2001 Harri Porten (porten@kde.org)
* Copyright (C) 2001 Peter Kelly (pmk@post.com)
* Copyright (C) 2003, 2006, 2007 Apple Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifndef Parser_h
#define Parser_h
#include <wtf/Forward.h>
#include <wtf/Noncopyable.h>
#include <wtf/RefPtr.h>
#include <wtf/Vector.h>
namespace KJS {
class Node;
class FunctionBodyNode;
class ProgramNode;
class UString;
struct UChar;
/**
* @internal
*
* Parses ECMAScript source code and converts into ProgramNode objects, which
* represent the root of a parse tree. The tree is then semantically
* checked with a semantic analyzer. This class provides a convenient
* workaround for the problem of the bison parser working in a static context.
*/
class Parser : Noncopyable {
public:
PassRefPtr<ProgramNode> parseProgram(const UString& sourceURL, int startingLineNumber,
const UChar* code, unsigned length,
int* sourceId = 0, int* errLine = 0, UString* errMsg = 0);
PassRefPtr<FunctionBodyNode> parseFunctionBody(const UString& sourceURL, int startingLineNumber,
const UChar* code, unsigned length,
int* sourceId = 0, int* errLine = 0, UString* errMsg = 0);
int sourceId() { return m_sourceId; }
void didFinishParsing(PassRefPtr<ProgramNode>);
static void noteNodeCycle(Node*);
static void removeNodeCycle(Node*);
// We keep track of various flags about the function body we're
// tracking on a stack; the FunctionBody ctor pops them off
// when we're done parsing and are making the body node.
void pushFunctionContext(unsigned initialFlags);
void setFunctionFlags(unsigned newFlags);
unsigned popFunctionContext();
private:
friend Parser& parser();
Parser(); // Use parser() instead.
void parse(const UString& sourceURL, int startingLineNumber,
const UChar* code, unsigned length,
int* sourceId = 0, int* errLine = 0, UString* errMsg = 0);
int m_sourceId;
RefPtr<ProgramNode> m_progNode;
WTF::Vector<unsigned, 8> m_functionFlags;
};
Parser& parser(); // Returns the singleton JavaScript parser.
inline void Parser::pushFunctionContext(unsigned initialFlags) {
m_functionFlags.append(initialFlags);
}
inline void Parser::setFunctionFlags(unsigned newFlags) {
m_functionFlags.last() |= newFlags;
}
inline unsigned Parser::popFunctionContext() {
unsigned flags = m_functionFlags.last();
m_functionFlags.removeLast();
return flags;
}
} // namespace KJS
#endif // Parser_h
// kate: indent-width 4; replace-tabs on; tab-width 4; space-indent on;
|
