compile-time gremlin/ql across pegged parse trees

[Dmitry Ponyatov]

Is anybody tried to implement some query-like adds for Dlang for 
making data selection from some data structures such as object 
graphs or trees (at least for pegged parsed data) ?

I'm writing tiny tool for KiCAD (EDA CAD), and it would be great 
to have some tool to write easy-readable declarative-like code 
for data selections/conversions in memory.

Or maybe someone can recommend book or tutorial about writing 
object graph traversals, backtracking and matching in C++ to let 
me make some elements myself?