Re:PhD student solves 2,500-year-old Sanskrit problem
by 082349872349872 on Thursday December 15, 2022 @09:17AM
(#33999811)
It's exactly a grammatical problem. And when we look at formal grammars on the computer side, we find in practice they consist of very regular expression and declaration sublanguages and an irregular statement sublanguage consisting of a finite number of exceptions.
On the language side, consider english verbs: there are a huge number of regular verbs, and a small number of irregular exceptions. Life be like that sometimes.
On the language side, consider english verbs: there are a huge number of regular verbs, and a small number of irregular exceptions. Life be like that sometimes.