2 * Copyright 2005 Maksim Orlovich <maksim@kde.org>
3 * Copyright (C) 2006 Apple Computer, Inc.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 #include "XPathStep.h"
31 #include "XPathPredicate.h"
35 typedef int ExceptionCode;
37 class XPathNSResolver;
49 NumericOp::Opcode numop;
50 EqTestOp::Opcode eqop;
52 Token(int t) : type(t) {}
53 Token(int t, const String& v): type(t), str(v) {}
54 Token(int t, Step::Axis v): type(t), axis(v) {}
55 Token(int t, NumericOp::Opcode v): type(t), numop(v) {}
56 Token(int t, EqTestOp::Opcode v): type(t), eqop(v) {}
60 WTF_MAKE_NONCOPYABLE(Parser);
65 XPathNSResolver* resolver() const { return m_resolver.get(); }
66 bool expandQName(const String& qName, String& localName, String& namespaceURI);
68 Expression* parseStatement(const String& statement, PassRefPtr<XPathNSResolver>, ExceptionCode&);
70 static Parser* current() { return currentParser; }
72 int lex(void* yylval);
74 Expression* m_topExpr;
75 bool m_gotNamespaceError;
77 void registerParseNode(ParseNode*);
78 void unregisterParseNode(ParseNode*);
80 void registerPredicateVector(Vector<Predicate*>*);
81 void deletePredicateVector(Vector<Predicate*>*);
83 void registerExpressionVector(Vector<Expression*>*);
84 void deleteExpressionVector(Vector<Expression*>*);
86 void registerString(String*);
87 void deleteString(String*);
89 void registerNodeTest(Step::NodeTest*);
90 void deleteNodeTest(Step::NodeTest*);
93 bool isBinaryOperatorContext() const;
96 Token makeTokenAndAdvance(int type, int advance = 1);
97 Token makeTokenAndAdvance(int type, NumericOp::Opcode, int advance = 1);
98 Token makeTokenAndAdvance(int type, EqTestOp::Opcode, int advance = 1);
99 char peekAheadHelper();
100 char peekCurHelper();
104 bool lexNCName(String&);
105 bool lexQName(String&);
108 Token nextTokenInternal();
110 void reset(const String& data);
112 static Parser* currentParser;
117 RefPtr<XPathNSResolver> m_resolver;
119 HashSet<ParseNode*> m_parseNodes;
120 HashSet<Vector<Predicate*>*> m_predicateVectors;
121 HashSet<Vector<Expression*>*> m_expressionVectors;
122 HashSet<String*> m_strings;
123 HashSet<Step::NodeTest*> m_nodeTests;