*
* LTTng filter expression parser
*
- * Copyright 2012 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+ * Copyright 2012 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
*
- * This library is free software; you can redistribute it and/or modify it
- * under the terms of the GNU Lesser General Public License, version 2.1 only,
- * as published by the Free Software Foundation.
- *
- * 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
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with this library; if not, write to the Free Software Foundation,
- * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ * SPDX-License-Identifier: LGPL-2.1-only
*
* Grammar inspired from http://www.quut.com/c/ANSI-C-grammar-y.html
*/
%type <gs> s_char s_char_sequence c_char c_char_sequence
%type <n> primary_expression
+%type <n> prefix_expression
+%type <n> prefix_expression_rec
%type <n> postfix_expression
%type <n> unary_expression
%type <n> unary_operator
%type <n> logical_and_expression
%type <n> logical_or_expression
%type <n> expression
+%type <n> identifiers
%%
}
;
-primary_expression
- : IDENTIFIER
- {
- $$ = make_node(parser_ctx, NODE_EXPRESSION);
- $$->u.expression.type = AST_EXP_IDENTIFIER;
- $$->u.expression.u.identifier = yylval.gs->s;
- }
- | GLOBAL_IDENTIFIER
- {
- $$ = make_node(parser_ctx, NODE_EXPRESSION);
- $$->u.expression.type = AST_EXP_GLOBAL_IDENTIFIER;
- $$->u.expression.u.identifier = yylval.gs->s;
- }
-
- | DECIMAL_CONSTANT
+primary_expression:
+ DECIMAL_CONSTANT
{
$$ = make_node(parser_ctx, NODE_EXPRESSION);
$$->u.expression.type = AST_EXP_CONSTANT;
}
;
-postfix_expression
- : primary_expression
- { $$ = $1; }
- | postfix_expression LSBRAC unary_expression RSBRAC
+identifiers
+ : IDENTIFIER
+ {
+ $$ = make_node(parser_ctx, NODE_EXPRESSION);
+ $$->u.expression.type = AST_EXP_IDENTIFIER;
+ $$->u.expression.u.identifier = yylval.gs->s;
+ }
+ | GLOBAL_IDENTIFIER
+ {
+ $$ = make_node(parser_ctx, NODE_EXPRESSION);
+ $$->u.expression.type = AST_EXP_GLOBAL_IDENTIFIER;
+ $$->u.expression.u.identifier = yylval.gs->s;
+ }
+ ;
+
+prefix_expression_rec
+ : LSBRAC unary_expression RSBRAC
+ {
+ $$ = $2;
+ }
+ | LSBRAC unary_expression RSBRAC prefix_expression_rec
+ {
+ $$ = $2;
+ $$->u.expression.pre_op = AST_LINK_BRACKET;
+ $$->u.expression.prev = $4;
+ }
+ ;
+
+prefix_expression
+ : identifiers
+ {
+ $$ = $1;
+ }
+ | identifiers prefix_expression_rec
{
$$ = $1;
$$->u.expression.pre_op = AST_LINK_BRACKET;
- $$->u.expression.next = $3;
+ $$->u.expression.next_bracket = $2;
}
- | postfix_expression DOT IDENTIFIER
+ ;
+
+postfix_expression
+ : prefix_expression
{
- $$ = make_node(parser_ctx, NODE_EXPRESSION);
- $$->u.expression.type = AST_EXP_IDENTIFIER;
+ $$ = $1;
+ }
+ | postfix_expression DOT prefix_expression
+ {
+ $$ = $3;
$$->u.expression.post_op = AST_LINK_DOT;
- $$->u.expression.u.identifier = $3->s;
$$->u.expression.prev = $1;
}
- | postfix_expression RARROW IDENTIFIER
+ | postfix_expression RARROW prefix_expression
{
- $$ = make_node(parser_ctx, NODE_EXPRESSION);
- $$->u.expression.type = AST_EXP_IDENTIFIER;
+ $$ = $3;
$$->u.expression.post_op = AST_LINK_RARROW;
- $$->u.expression.u.identifier = $3->s;
$$->u.expression.prev = $1;
}
;
unary_expression
: postfix_expression
{ $$ = $1; }
+ | primary_expression
+ { $$ = $1; }
| unary_operator unary_expression
{
$$ = $1;
| NOT_BIN
{
$$ = make_node(parser_ctx, NODE_UNARY_OP);
- $$->u.unary_op.type = AST_UNARY_BIN_NOT;
+ $$->u.unary_op.type = AST_UNARY_BIT_NOT;
}
;
{ $$ = $1; }
| shift_expression LEFT_OP additive_expression
{
- $$ = make_op_node(parser_ctx, AST_OP_LSHIFT, $1, $3);
+ $$ = make_op_node(parser_ctx, AST_OP_BIT_LSHIFT, $1, $3);
}
| shift_expression RIGHT_OP additive_expression
{
- $$ = make_op_node(parser_ctx, AST_OP_RSHIFT, $1, $3);
+ $$ = make_op_node(parser_ctx, AST_OP_BIT_RSHIFT, $1, $3);
}
;
-relational_expression
+and_expression
: shift_expression
{ $$ = $1; }
- | relational_expression LT_OP shift_expression
+ | and_expression AND_BIN shift_expression
+ {
+ $$ = make_op_node(parser_ctx, AST_OP_BIT_AND, $1, $3);
+ }
+ ;
+
+exclusive_or_expression
+ : and_expression
+ { $$ = $1; }
+ | exclusive_or_expression XOR_BIN and_expression
+ {
+ $$ = make_op_node(parser_ctx, AST_OP_BIT_XOR, $1, $3);
+ }
+ ;
+
+inclusive_or_expression
+ : exclusive_or_expression
+ { $$ = $1; }
+ | inclusive_or_expression OR_BIN exclusive_or_expression
+ {
+ $$ = make_op_node(parser_ctx, AST_OP_BIT_OR, $1, $3);
+ }
+ ;
+
+relational_expression
+ : inclusive_or_expression
+ { $$ = $1; }
+ | relational_expression LT_OP inclusive_or_expression
{
$$ = make_op_node(parser_ctx, AST_OP_LT, $1, $3);
}
- | relational_expression GT_OP shift_expression
+ | relational_expression GT_OP inclusive_or_expression
{
$$ = make_op_node(parser_ctx, AST_OP_GT, $1, $3);
}
- | relational_expression LE_OP shift_expression
+ | relational_expression LE_OP inclusive_or_expression
{
$$ = make_op_node(parser_ctx, AST_OP_LE, $1, $3);
}
- | relational_expression GE_OP shift_expression
+ | relational_expression GE_OP inclusive_or_expression
{
$$ = make_op_node(parser_ctx, AST_OP_GE, $1, $3);
}
}
;
-and_expression
- : equality_expression
- { $$ = $1; }
- | and_expression AND_BIN equality_expression
- {
- $$ = make_op_node(parser_ctx, AST_OP_BIN_AND, $1, $3);
- }
- ;
-
-exclusive_or_expression
- : and_expression
- { $$ = $1; }
- | exclusive_or_expression XOR_BIN and_expression
- {
- $$ = make_op_node(parser_ctx, AST_OP_BIN_XOR, $1, $3);
- }
- ;
-
-inclusive_or_expression
- : exclusive_or_expression
- { $$ = $1; }
- | inclusive_or_expression OR_BIN exclusive_or_expression
- {
- $$ = make_op_node(parser_ctx, AST_OP_BIN_OR, $1, $3);
- }
- ;
-
logical_and_expression
- : inclusive_or_expression
+ : equality_expression
{ $$ = $1; }
- | logical_and_expression AND_OP inclusive_or_expression
+ | logical_and_expression AND_OP equality_expression
{
$$ = make_op_node(parser_ctx, AST_OP_AND, $1, $3);
}