PromQL.Parser

A parser for the Prometheus Query Language (PromQL), written in C# and using the Superpower parsing library.

Installation

Requires .NET core 3.1+

dotnet add package PromQL.Parser

User guide

Parsing and validating PromQL

Parser.ParseExpression will parse a provided expression into an Abstract Syntax Tree representation:

Parser.ParseExpression(@"
    # This is a test expression
    sum by (code) (rate(http_request_count{code !~ '5xx'}[1m]))
    / sum by (code) (rate(http_request_count[1m]))
").ToString()

Returns:

BinaryExpr { 
  LeftHandSide = AggregateExpr { 
    OperatorName = sum, 
    Expr = FunctionCall { 
      Identifier = rate,
      Args = [ 
        MatrixSelector { 
          Vector = VectorSelector { 
            MetricIdentifier = MetricIdentifier { Value = http_request_count }, 
            LabelMatchers = LabelMatchers { 
              Matchers = [ 
                LabelMatcher { LabelName = code, Operator = NotRegexp, Value = StringLiteral { Quote = ', Value = 5xx } } 
              ] 
            } 
          }, 
          Duration = Duration { Value = 00:01:00 } 
        } 
      ] 
    }, 
    Param = , 
    GroupingLabels = System.Collections.Immutable.ImmutableArray`1[System.String], 
    Without = False 
  }, 
  RightHandSide = AggregateExpr { 
    OperatorName = sum, 
    Expr = FunctionCall { 
      Identifier = rate,
      Args = [ 
        MatrixSelector { 
          Vector = VectorSelector { 
            MetricIdentifier = MetricIdentifier { Value = http_request_count }, 
            LabelMatchers =  
          }, 
          Duration = Duration { Value = 00:01:00 } 
        } 
      ]
    }, 
    Param = , 
    GroupingLabels = System.Collections.Immutable.ImmutableArray`1[System.String], 
    Without = False 
  }, 
  Operator = Div, 
  VectorMatching = VectorMatching { 
    MatchCardinality = OneToOne, 
	MatchingLabels = System.Collections.Immutable.ImmutableArray`1[System.String], \
	On = False, 
	Include = System.Collections.Immutable.ImmutableArray`1[System.String], 
	ReturnBool = False 
  } 
}

Invalid expressions will throw an exception, e.g:

// Too many brackets + missing rest of matrix selector
Parser.ParseExpression("http_request_count[[ ")

Throws:

Superpower.ParseException: Syntax error (line 1, column 21): Unexpected left bracket.
   at Superpower.Tokenizer`1.Tokenize(String source)
   at PromQL.Parser.Parser.ParseExpression(String input, Tokenizer tokenizer)
   at UserQuery.Main() in C:\Users\james.luck\AppData\Local\Temp\LINQPad6\_aryncqeb\dwfjew\LINQPadQuery:line [[

Type checking

The syntax of expressions is not only validated but the resulting types of expressions can be validated and returned with CheckType, e.g:

Parser.ParseExpression("1 + sum_over_time(some_metric[1h])").CheckType();

Returns:

ValueType.Vector

Expressions that violate the PromQL type system will throw an exception, e.g:

Parser.ParseExpression("'a' + 'b'").CheckType();

Throws:

Unexpected type 'string' was provided, expected one of 'scalar', 'instant vector': 0 (line 1, column 1)
   at PromQL.Parser.TypeChecker.ExpectTypes(Expr expr, ValueType[] expected)
   at PromQL.Parser.TypeChecker.CheckType(Expr expr)
   at UserQuery.Main(), line 1

Modifying PromQL expressions

The Abstract Syntax Tree is represented using record types. This means making modified copies of the AST is trivial:

var expr = (BinaryExpr) Parser.ParseExpression(@"1 + 1");

// original expression is not mutated
var newExpr = expr with { RightHandSide = new NumberLiteral(2) };

newExpr equals:

BinaryExpr { 
  LeftHandSide = NumberLiteral { Value = 1 }, 
  RightHandSide = NumberLiteral { Value = 2 }, 
  Operator = Add, 
  VectorMatching = ...
}

Deep cloning of Expr is also supported via Expr.DeepClone(). Additionally all Expr AST types are mutable and can also be updated in place using a visitor such as DepthFirstExpressionVisitor.

Emitting PromQL expressions

An Abstract Syntax Tree can be converted back to its PromQL string representation, e.g:

var printer = new Printer();
var expr = Parser.ParseExpression(@"
        # A comment
        sum(
            avg_over_time(metric[1h:5m])
        ) by (label1)
    ");
        
printer.ToPromQl(expr);

Produces:

// NOTE:
// 1. Comments are not preserved
// 2. Whitespace/ indentation is not preserved
// 3. Language elements may be in a different order than originally specified
sum by (label1) (avg_over_time(metric[1h:5m]))

Creating PromQL expressions

You can directly manipulate the AST classes to build up PromQL expressions. However, there is currently very little in the way of checks that prevent you from either creating syntactically or semantically invalid expressions- use with care.

Parsing extensions to PromQL

This parser is reasonably extensible and can be modified to recognize extensions to the PromQL spec. See this test for an example on how to parse the $__interval extension Grafana uses.

Unsupported language features

This library aims to parse 99% of the PromQL language and has extensive test coverage. However, some language features are currently unsupported:

Unicode string escaping
Hexadecimal/ octal string escaping
Hexadecimal number representation
The @ modifier
Exponential operator associativity (is parsed with left associativity)

If any of these features are important to you, please create an issue or submit a pull request.

djluck / promql.parser Goto Github PK

promql.parser's Introduction

PromQL.Parser

Installation

User guide

Parsing and validating PromQL

Type checking

Modifying PromQL expressions

Emitting PromQL expressions

Creating PromQL expressions

Parsing extensions to PromQL

Unsupported language features

promql.parser's People

Contributors

Stargazers

Watchers

Forkers

promql.parser's Issues

Recommend Projects

Recommend Topics

Recommend Org