-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
The parent project, https://github.com/zhong-j-yu/rekex , is a parser generator that mirrors grammar rules with datatypes. Since recursive types are not a problem, we don't have have a problem with recursive grammar rules.
Ah interesting, not sure I entirely understand what you mean by an object graph. My project implements a recursive descent parser that allows for left recursion by curtailment. I think that's probably equivalent to what you're referring to as a cyclic object graph. Its basically a partial implementation of the algorithm described in this paper: Modular and Efficient Top-Down Parsing for Ambiguous Left-Recursive Grammars. You can check out the code here https://github.com/ciherrera20/Calculator.