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 "core/xml/XPathPredicate.h"
31 #include "core/xml/XPathStep.h"
36 class XPathNSResolver;
50 NumericOp::Opcode numop;
51 EqTestOp::Opcode eqop;
53 Token(int t) : type(t) { }
54 Token(int t, const String& v): type(t), str(v) { }
55 Token(int t, Step::Axis v): type(t), axis(v) { }
56 Token(int t, NumericOp::Opcode v): type(t), numop(v) { }
57 Token(int t, EqTestOp::Opcode v): type(t), eqop(v) { }
61 WTF_MAKE_NONCOPYABLE(Parser);
67 XPathNSResolver* resolver() const { return m_resolver.get(); }
68 bool expandQName(const String& qName, AtomicString& localName, AtomicString& namespaceURI);
70 PassOwnPtrWillBeRawPtr<Expression> parseStatement(const String& statement, PassRefPtrWillBeRawPtr<XPathNSResolver>, ExceptionState&);
72 static Parser* current() { return currentParser; }
74 int lex(void* yylval);
76 RawPtrWillBeMember<Expression> m_topExpr;
77 bool m_gotNamespaceError;
79 void registerParseNode(ParseNode*);
80 void unregisterParseNode(ParseNode*);
82 void registerPredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate> >*);
83 void deletePredicateVector(WillBeHeapVector<OwnPtrWillBeMember<Predicate> >*);
85 void registerExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expression> >*);
86 void deleteExpressionVector(WillBeHeapVector<OwnPtrWillBeMember<Expression> >*);
88 void registerString(String*);
89 void deleteString(String*);
91 void registerNodeTest(Step::NodeTest*);
92 void deleteNodeTest(Step::NodeTest*);
95 bool isBinaryOperatorContext() const;
98 Token makeTokenAndAdvance(int type, int advance = 1);
99 Token makeTokenAndAdvance(int type, NumericOp::Opcode, int advance = 1);
100 Token makeTokenAndAdvance(int type, EqTestOp::Opcode, int advance = 1);
101 char peekAheadHelper();
102 char peekCurHelper();
106 bool lexNCName(String&);
107 bool lexQName(String&);
110 Token nextTokenInternal();
112 void reset(const String& data);
114 static Parser* currentParser;
119 RefPtrWillBeMember<XPathNSResolver> m_resolver;
122 HashSet<ParseNode*> m_parseNodes;
123 HashSet<Vector<OwnPtr<Predicate> >*> m_predicateVectors;
124 HashSet<Vector<OwnPtr<Expression> >*> m_expressionVectors;
125 HashSet<OwnPtr<Step::NodeTest> > m_nodeTests;
127 HashSet<OwnPtr<String> > m_strings;
134 int xpathyyparse(blink::XPath::Parser*);