In Sanskrit, the syntax allows for meaning to remain consistent regardless of the order of words used, similar to a flexible syntax in programming languages.
Sanskrit's free word order is made possible by using suffixes to define relationships, akin to structured data in well-designed programs.
Researchers, linguists, and computer scientists are looking at Sanskrit as a model for computational language systems due to its unique syntax and structured nature.
Panini's ancient grammar in Sanskrit, Ashtadhyayi, is likened to a formal programming language, showcasing rules, exceptions, and concise logic.