graph containing comprehensive set of ill-formed shapes

My alt-SHACL implementation does complete syntax checking, signalling whenever
in encounters a shape or path or list that is not correctly formed.  My
implementation has a strict mode that signals whenever the putative shapes
graph contains anything that violates any of the SHACL Core syntax rules or
contains a recursive shape or contains SHACL-SPARQL constructs that could
affect validation.  To test this checking I had put together an RDF graph
containing a comprehensive set of constructs that need to be checked.

I just updated this graph, and the associated checking code, to incorporate
the numerous additional syntax rules that were added when the SHACL document
became a candidate recommendation.   I include the graph here.  It can be
turned into a comprehensive set of syntax test cases for SHACL Core by just
separating it into small graphs each containing one of the test shapes.

The amount of code required to do complete syntax checking was quite modest.
Running my implementation over the graph was helpful in finding bugs such as
incorrect recursion checks in the path code.  I strongly recommend that every
SHACL implementation be run on every shape in this graph.

Peter F. Patel-Schneider
Nuance Communications