CFPQ#
- Release:
6.1.1
- Date:
Oct 15, 2026
Context-free path queries (CFPQ) constrain the paths of a labeled graph by a context-free language: a pair \((u, v)\) is reachable if some path from \(u\) to \(v\) is labeled by a string of the language. A query is specified by a grammar template instantiated per graph from its stored labels; one query may carry several representations of the same language (a CFG or an RSM). The graph catalog is shared across all query classes — the “Applicable graphs” list below cross-links the per-graph pages without duplicating them.
Grammar templates#
Grammar |
Class |
Kind |
|---|---|---|
Context-Free |
Hierarchical |
|
Context-Free |
Hierarchical |
|
Context-Free |
Static Analysis |
|
Context-Free |
Static Analysis |
The static-analysis grammars use a compact indexed form; see Indexed Grammars.
Applicable graphs#
Graphs from the shared catalog that carry at least one CFPQ query.