cid:
"bafyreibd2er47ct7ccmd24odn5cwh7nrdsdsycfbpeos3hzxacmv2vzql4"
value:
text:
"given that there are ways of parsing regices as finite automata (swtch.com/~rsc/regexp/...), i think it might be sufficient to just track which states were "hit" during a match and mark them as checked? no idea if/how this extends to the higher-order-grammar stuff like backrefs though"
$type:
"app.bsky.feed.post"
embed:
$type:
"app.bsky.embed.external"
external:
title:
"Regular Expression Matching Can Be Simple And Fast"
description:
""
langs:
"en"
reply:
root:
cid:
"bafyreiadouorhweqt3s7gszm7y5jjavlz2tnwsqaaitg73tigo3hgaemwq"
parent:
cid:
"bafyreiawscujg6vq4jyob5uxpzxlqpko65qiyxonzh6nmep6mcubx6m4r4"
facets:
index:
byteEnd:
90
byteStart:
65
features:
$type:
"app.bsky.richtext.facet#link"
createdAt:
"2024-09-15T20:26:25.619Z"
success:
true
identity:
@context:
alsoKnownAs:
verificationMethod:
type:
"Multikey"
controller:
"did:plc:6ibrki5zpw77nhn46z2undaa"
publicKeyMultibase:
"zQ3shZcMWwBECNcEvdun9wmtmLqAYXLoEwrzsrknH72ss1wRG"
service:
id:
"#atproto_pds"
type:
"AtprotoPersonalDataServer"
serviceEndpoint:
"https://puffball.us-east.host.bsky.network"