Recover recognition and the complete finite or cyclic packed parse forest for a ...
https://detect.halowerk.com/v1/F-TD2000-DATASTRUCTURES-10/earley-cfg-nullable-leftrecursive-packed-parse-forestOverview
Recover recognition and the complete finite or cyclic packed parse forest for a supplied word and nullable/left-recursive context-free grammar, rather than LL1 prediction or language-finiteness checks.
Protocol
x402 (POST)
Price
$0.0030
Payment Asset
USD Coin
Payment Network
eip155:8453
Category
uncategorized
Provider
detect
Source
bazaar
Indexed
2026-11-02 17:26:09
Health
Status
unknown
Latency (p50)
—
Uptime (30d)
—
Reliability Score
—
Last Checked
Never
Last Healthy
Never
Consecutive Failures
0
x402 Payment Validation
Payment Requirements
—
Asset Verified
—
Facilitator
—
Input Schema
{
"body": {
"artifact": {
"earleyForest": {
"claim": null,
"data": {
"nonterminals": 1,
"productions": [
{
"left": 0,
"right": [
{
"t": "a"
}
]
}
],
"start": 0,
"word": [
"b"
]
}
}
}
},
"bodyType": "json",
"method": "POST",
"type": "http"
}
Output Schema
{
"example": {
"billable": true,
"findings": [
{
"confidence": 1,
"evidence": [
{
"page_indices": [],
"page_url": null,
"pattern": "earley-cfg-nullable-leftrecursive-packed-parse-forest_scoped_evidence",
"type": "artifact"
}
],
"limits": [
"Complete bounded CFG production-set parse forest for an atomic token word, including nullable/left-recursive cycles and exact finite/infinite derivation counts. No duplicate productions, weighted parsing, tokenization or language-wide finiteness claim; bounded forest/work abstains unknown."
],
"module": "earley-cfg-nullable-leftrecursive-packed-parse-forest",
"state": "observed",
"value": {
"claim_matches": false,
"computed": {
"derivations": "0",
"nodes": [],
"recognized": false,
"root": null
}
},
"warnings": []
}
],
"known_count": 1,
"scope": {
"contact_values_returned": false,
"network": false,
"supplied_artifact_only": true
},
"warnings": []
},
"type": "json"
}