1/*
2 * Copyright 2005 Maksim Orlovich <maksim@kde.org>
3 * Copyright (C) 2006 Apple Computer, Inc.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
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.
14 *
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.
25 */
26
27#ifndef XPathParser_h
28#define XPathParser_h
29
30#include "XPathStep.h"
31#include "XPathPredicate.h"
32
33namespace WebCore {
34
35    typedef int ExceptionCode;
36
37    class XPathNSResolver;
38
39    namespace XPath {
40
41        class Expression;
42        class ParseNode;
43        class Predicate;
44
45        struct Token {
46            int type;
47            String str;
48            Step::Axis axis;
49            NumericOp::Opcode numop;
50            EqTestOp::Opcode eqop;
51
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) {}
57        };
58
59        class Parser {
60            WTF_MAKE_NONCOPYABLE(Parser);
61        public:
62            Parser();
63            ~Parser();
64
65            XPathNSResolver* resolver() const { return m_resolver.get(); }
66            bool expandQName(const String& qName, String& localName, String& namespaceURI);
67
68            Expression* parseStatement(const String& statement, PassRefPtr<XPathNSResolver>, ExceptionCode&);
69
70            static Parser* current() { return currentParser; }
71
72            int lex(void* yylval);
73
74            Expression* m_topExpr;
75            bool m_gotNamespaceError;
76
77            void registerParseNode(ParseNode*);
78            void unregisterParseNode(ParseNode*);
79
80            void registerPredicateVector(Vector<Predicate*>*);
81            void deletePredicateVector(Vector<Predicate*>*);
82
83            void registerExpressionVector(Vector<Expression*>*);
84            void deleteExpressionVector(Vector<Expression*>*);
85
86            void registerString(String*);
87            void deleteString(String*);
88
89            void registerNodeTest(Step::NodeTest*);
90            void deleteNodeTest(Step::NodeTest*);
91
92        private:
93            bool isBinaryOperatorContext() const;
94
95            void skipWS();
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();
101
102            Token lexString();
103            Token lexNumber();
104            bool lexNCName(String&);
105            bool lexQName(String&);
106
107            Token nextToken();
108            Token nextTokenInternal();
109
110            void reset(const String& data);
111
112            static Parser* currentParser;
113
114            unsigned m_nextPos;
115            String m_data;
116            int m_lastTokenType;
117            RefPtr<XPathNSResolver> m_resolver;
118
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;
124        };
125
126    }
127}
128
129#endif
130