Paninian Grammar

Origin. Panini, Ashtadhyayi (c. 4th century BCE). Approximately 4000 sutras that generate all valid Sanskrit sentences. The earliest known formal generative grammar.

Mechanism. The grammar operates as an algorithm. Roots and affixes are inputs; rules transform and combine them; valid words and sentences are outputs. The rules are ordered and interact — later rules can block or modify earlier ones. Meta-rules govern rule application. The system is complete (generates all valid forms) and exclusive (does not generate invalid forms). The compression is extreme: the entire grammar fits in a small text memorizable by a single person.

Procedure. To generate or validate a Sanskrit form: (1) Identify the root (dhatu) and desired meaning. (2) Apply the rules (sutras) in order, beginning with the most general and proceeding to exceptions. (3) Follow meta-rules (paribhashas) that govern rule interaction — including the principle that a more specific rule overrides a more general one. (4) Apply sandhi (combination) rules where morphemes meet. (5) The output is a valid Sanskrit form if and only if the derivation completes without violation. To analyze an existing form, work backward: identify possible derivations that could produce it.

Applies to. Language formalization. Algorithmic thinking. Any domain where a finite set of rules must generate an infinite set of valid outputs while excluding invalid ones.

Limitations. The system assumes mastery of its metalanguage; the sutras are maximally compressed and require extensive training to apply. The grammar describes Sanskrit as Panini knew it; later developments require supplementary rules. The method formalizes existing usage rather than creating new language. The extreme compression trades accessibility for completeness.