|
qi::rule< Iterator,
ast::ExpressionNode(), Skipper > | m_topLevelExpressionRule |
|
qi::rule< Iterator,
ast::ExpressionNode(),
qi::locals
< ast::ExpressionNode >
, Skipper > | m_expressionRule |
|
qi::rule< Iterator,
ast::SubexpressionNode(ast::ExpressionNode
&), Skipper > | m_subexpressionRule |
|
qi::rule< Iterator,
ast::IndexExpressionNode(ast::ExpressionNode
&), Skipper > | m_indexExpressionRule |
|
qi::rule< Iterator,
ast::HashWildcardNode(ast::ExpressionNode
&), Skipper > | m_hashWildcardRule |
|
qi::rule< Iterator,
ast::HashWildcardNode(ast::ExpressionNode
&), Skipper > | m_hashWildcardSubexpressionRule |
|
qi::rule< Iterator,
ast::BracketSpecifierNode(),
Skipper > | m_bracketSpecifierRule |
|
qi::rule< Iterator,
ast::ArrayItemNode(), Skipper > | m_arrayItemRule |
|
qi::rule< Iterator,
ast::FlattenOperatorNode(),
Skipper > | m_flattenOperatorRule |
|
qi::rule< Iterator,
ast::FilterExpressionNode(),
Skipper > | m_filterExpressionRule |
|
qi::rule< Iterator,
ast::SliceExpressionNode(),
Skipper > | m_sliceExpressionRule |
|
qi::rule< Iterator,
ast::ListWildcardNode(),
Skipper > | m_listWildcardRule |
|
qi::rule< Iterator,
ast::MultiselectListNode(),
Skipper > | m_multiselectListRule |
|
qi::rule< Iterator,
ast::MultiselectHashNode(),
Skipper > | m_multiselectHashRule |
|
qi::rule< Iterator,
ast::MultiselectHashNode::KeyValuePairType(),
Skipper > | m_keyValuePairRule |
|
qi::rule< Iterator,
ast::NotExpressionNode(ast::ExpressionNode
&), Skipper > | m_notExpressionRule |
|
qi::rule< Iterator,
ast::PipeExpressionNode(ast::ExpressionNode
&), Skipper > | m_pipeExpressionRule |
|
qi::rule< Iterator,
ast::ComparatorExpressionNode(ast::ExpressionNode
&), Skipper > | m_comparatorExpressionRule |
|
qi::symbols< UnicodeChar,
ast::ComparatorExpressionNode::Comparator > | m_comparatorSymbols |
|
qi::rule< Iterator,
ast::OrExpressionNode(ast::ExpressionNode
&), Skipper > | m_orExpressionRule |
|
qi::rule< Iterator,
ast::AndExpressionNode(ast::ExpressionNode
&), Skipper > | m_andExpressionRule |
|
qi::rule< Iterator,
ast::ParenExpressionNode(),
Skipper > | m_parenExpressionRule |
|
qi::rule< Iterator,
ast::FunctionExpressionNode(),
Skipper > | m_functionExpressionRule |
|
qi::rule< Iterator,
std::vector
< ast::FunctionExpressionNode::ArgumentType >
), Skipper > | m_functionArgumentListRule |
|
qi::rule< Iterator,
ast::FunctionExpressionNode::ArgumentType(),
Skipper > | m_functionArgumentRule |
|
qi::rule< Iterator,
ast::ExpressionArgumentNode(),
Skipper > | m_expressionArgumentRule |
|
qi::rule< Iterator,
ast::IdentifierNode(), Skipper > | m_identifierRule |
|
qi::rule< Iterator,
ast::RawStringNode(), Skipper > | m_rawStringRule |
|
qi::rule< Iterator,
ast::LiteralNode(), Skipper > | m_literalRule |
|
qi::rule< Iterator,
ast::CurrentNode()> | m_currentNodeRule |
|
qi::rule< Iterator, UnicodeChar()> | m_literalCharRule |
|
qi::rule< Iterator, UnicodeChar()> | m_literalEscapeRule |
|
qi::rule< Iterator, UnicodeChar()> | m_rawStringCharRule |
|
qi::rule< Iterator, std::pair
< UnicodeChar, UnicodeChar >)> | m_rawStringEscapeRule |
|
qi::rule< Iterator, String()> | m_quotedStringRule |
|
qi::rule< Iterator, String()> | m_unquotedStringRule |
|
qi::rule< Iterator, UnicodeChar()> | m_unescapedCharRule |
|
qi::rule< Iterator, UnicodeChar()> | m_escapedCharRule |
|
qi::rule< Iterator, UnicodeChar()> | m_unicodeCharRule |
|
qi::rule< Iterator, UnicodeChar()> | m_surrogatePairCharacterRule |
|
qi::rule< Iterator > | m_quoteRule |
|
qi::rule< Iterator > | m_escapeRule |
|
qi::symbols< UnicodeChar,
UnicodeChar > | m_controlCharacterSymbols |
|
qi::rule< Iterator, Index()> | m_indexRule |
|
template<typename Iterator, typename Skipper = encoding::space_type>
class jmespath::parser::Grammar< Iterator, Skipper >
The Grammar class contains the PEG rule definition based on the EBNF specifications of JMESPath.
The actual grammar is slightly modified compared to the specifications to eliminate left recursion.
- Template Parameters
-
Iterator | String iterator type |
Skipper | Character skipper parser type |
- See Also
- http://jmespath.org/specification.html#grammar