What a cool gift. I didn't know Knuth was into Sanskrit poetry. Nice to notice that people from STEM fields are interested in things like that. I'm always happy to see something related to ancient languages in HN.
There is perhaps a technical reason for this. Computer languages are described using BNF notation, apparently invented in the 20th century, but others have noted that Panini did this 2500 years earlier, describing Sanskrit with a similar notation:
The idea of describing the structure of language using rewriting rules can be traced back to at least the work of Pāṇini (ancient Indian Sanskrit grammarian and a revered scholar in Hinduism who lived sometime between the 7th and 4th century BCE).[1][2] His notation to describe Sanskrit word structure notation is equivalent in power to that of Backus and has many similar properties.
LR parsers were invented by Donald Knuth in 1965 as an efficient generalization of precedence parsers. Knuth proved that LR parsers were the most general-purpose parsers possible that would still be efficient in the worst cases.
It is widely assumed Pāṇinian languages (generated using the formalism he used for describing Sanskrit) are context free languages but the following paper argues that they are a much larger set than CFLs.
My Knuth tale: I happened to be sitting near Prof. Knuth at a dinner last December and I mentioned to him Pāṇini & Sanskrit in the context of something I work on now and then. He heard Sanskrit and immediately pointed me to this Christmas lecture of his!
Actually, based on my limited social circle, people from STEM get into Sanskrit much faster, because of its complex rules and similarity to programming (it's their words, I don't know Sanskrit, so can't confirm it). Learning Sanskrit is kinda "cool" now. Also, my girlfriend (not from STEM background) knows Sanskrit pretty well and keeps telling me that she feels like writing code (as she imagines that from seeing me doing or talking about it) when translating text to/from Sanskrit.
https://en.wikipedia.org/wiki/Backus%E2%80%93Naur_form
The idea of describing the structure of language using rewriting rules can be traced back to at least the work of Pāṇini (ancient Indian Sanskrit grammarian and a revered scholar in Hinduism who lived sometime between the 7th and 4th century BCE).[1][2] His notation to describe Sanskrit word structure notation is equivalent in power to that of Backus and has many similar properties.
Citation:
https://dl.acm.org/citation.cfm?id=363165
I can't copy the text here, but it's worth a read:
https://www.deepdyve.com/lp/association-for-computing-machin...
Knuth is mentioned in the same letter as Panini, regarding the naming of "BNF".
https://www.infinityfoundation.com/mandala/t_es/t_es_rao-t_s...
Knuth invented LR parsing of context free grammars:
https://en.wikipedia.org/wiki/LR_parser
LR parsers were invented by Donald Knuth in 1965 as an efficient generalization of precedence parsers. Knuth proved that LR parsers were the most general-purpose parsers possible that would still be efficient in the worst cases.