Hannes Voigt

Hi, Thank you for engaging with the openCypher grammar. To your problem: Unfortunately, I cannot speak to the C++ specific part of it. If the behavior is indeed different between...

Hi Piotr, Thank you for your question and for engaging with the openCypher artifacts. Unfortunately, I cannot really get a handle on your question. Could be please be more precise?...

Hi Piotr, thanks for your detailed reply. I understand you are confused why a parser gives you for `n.name='Adam' AND n.age=18` an `OrExpression` containing a `XorExpression` containing an `AndExpression` containing...

See #530

I think `FROM xxx match (a:Person) UPDATE GRAPH merge (b:Student{name:a.name})` is not a valid statement. In `UPDATE GRAPH` you only get to do `DELETE`, `SET`, `REMOVE` on prior matched variables....

This work has be outdate by the #478. #478 still uses the AntlrParser for the grammar check of queries, but consumes the scenarios through the TCK API which parser parameters...

Hi Daniel, thanks for your question and for using the openCypher artifacts. I understand, you have some trouble consuming the parsing result from Antlr. I am not an Antlr expert...

Hi Daniel, I have modified your visitor here https://github.com/dahoat/OpenCypherExperiments/pull/1 to demonstrate how you can reproduce the groups without needing a grammar changes. Hope it helps. -H

The `ShortestPathPattern`, which is the grammar non-terminal that contains both, `shortestPath` and `allShortestPaths` is still in the [grammar specification](https://github.com/opencypher/openCypher/blob/master/grammar/basic-grammar.xml#L75). The specification files are the point of truth. The EBNF files...

Unfortunately, is wasn't as simple as I have hoped. :-(