https://2024.issta.org/details/issta-2024-papers/89/Better-Not-Together-Staged-Solving-for-Context-Free-Language-Reachability
This is a super interesting approach to figuring out how to nagivate paths through parsers written to accept context free languages, when the grammar of the parser is known: break up the grammar into parts and do different complimentary stages of CFG exploration based on those parts of the original grammar
kaoudis
npub1gd…y5nf7
2024-09-19 12:45:28 UTC
Author Public Key
npub1gde9rfpwxyzajsespdeanfeuxyqj5ltjf4fux4gyqyajppsp6vxq0y5nf7Seen on
wss://relay.momostr.pinkPublished at
2024-09-19 12:45:28 UTCEvent JSON
{
"id": "28a0f8443b8425d9cd19ed0b8829d123a3cd8e83050a4bdd23a8e18141507343",
"pubkey": "437251a42e3105d943300b73d9a73c31012a7d724d53c35504013b208601d30c",
"created_at": 1726749928,
"kind": 1,
"tags": [
[
"proxy",
"https://infosec.exchange/@kaoudis/113164283304888705",
"web"
],
[
"proxy",
"https://infosec.exchange/users/kaoudis/statuses/113164283304888705",
"activitypub"
],
[
"L",
"pink.momostr"
],
[
"l",
"pink.momostr.activitypub:https://infosec.exchange/users/kaoudis/statuses/113164283304888705",
"pink.momostr"
],
[
"-"
]
],
"content": "https://2024.issta.org/details/issta-2024-papers/89/Better-Not-Together-Staged-Solving-for-Context-Free-Language-Reachability\n\nThis is a super interesting approach to figuring out how to nagivate paths through parsers written to accept context free languages, when the grammar of the parser is known: break up the grammar into parts and do different complimentary stages of CFG exploration based on those parts of the original grammar",
"sig": "2a3a384f9e6022bcf0aa28bd9bf030d769f551342a8437087efa6d2741882bd49aba6d1b37f92d95c0d7f87a4f55c6877dca64dc130786d179371c06690a92cc"
}