Event JSON
{
"id": "697ee6792470b201aa08d4ad6bae659c97449d1788e2ba0a140ce5960b2dc0e9",
"pubkey": "ced8854413eb31949434fdf2005cdd22937a4b12e2699cec34799e8f5710ec89",
"created_at": 1723059504,
"kind": 1,
"tags": [
[
"e",
"c2a9cf1ea2ac7087c4f7a387a274d9cf6c6a6122168c1389af4f9265484f90fd",
"",
"root",
"ced8854413eb31949434fdf2005cdd22937a4b12e2699cec34799e8f5710ec89"
],
[
"e",
"c488d500b2171c5843a1ffa5eccf1fa55522306e664e3aad528cc4d992bacc08",
"",
"reply",
"ede54dc1ff41d69fc081c29979507e283ce4b687d44b7ae10b39b6d1660b4916"
],
[
"proxy",
"https://social.sdf.org/@elb/112922427699186046",
"web"
],
[
"p",
"ede54dc1ff41d69fc081c29979507e283ce4b687d44b7ae10b39b6d1660b4916"
],
[
"p",
"ced8854413eb31949434fdf2005cdd22937a4b12e2699cec34799e8f5710ec89"
],
[
"proxy",
"https://social.sdf.org/users/elb/statuses/112922427699186046",
"activitypub"
],
[
"L",
"pink.momostr"
],
[
"l",
"pink.momostr.activitypub:https://social.sdf.org/users/elb/statuses/112922427699186046",
"pink.momostr"
],
[
"-"
]
],
"content": "Recursive descent is very common for parsers, and not quite the same as an LL(1) parser using recursion. Recursion depth can technically still be a problem in a lisp language, as not all recursive calls will be tail recursion. A recursive descent lexical analyzer isn't a \"thing\", although as other replies have pointed out, it's common in functional languages for a lexer to look a lot like a recursive descent parser for the \"grammar\" of tokens.",
"sig": "3c445ac3e6d67a19ebc897e93945266bd5a39b1de7b2f9b6cc7fc1207fa90d96d3c6927ac0a1e5136e5ca36efe234ef19c32a82ccc1f65b8aab16ff453b1bba3"
}