Panini and computer languages (Backus–Naur form)
AI-drafted · awaiting admin review
It is often said that computer language notation was 'based on Panini'. The two are strikingly alike, but the computer notation was invented independently.
Independent discoveriesCulture, games, language & ideas
Indian claim
Panini's method of rules and meta-rules is the ancestor of the notation used to define programming languages, which some call 'Panini–Backus form'.
Evidence for the Indian claim
- Panini's grammar uses rewrite rules, meta-rules, abbreviations and ordering of rules, which computer scientists have compared to formal language notation.
- In 1967 P. Z. Ingerman proposed renaming BNF 'Panini–Backus form' in recognition of the similarity.
Commonly credited to
John Backus and Peter Naur created the notation (Backus–Naur form, BNF) to describe the ALGOL programming language around 1959–1960.
Evidence for the other claim
- Backus developed his notation from work in logic and formal languages (Emil Post's production systems and Chomsky's grammars), with no known knowledge of Panini.
- Scholars note that Panini's grammar works through derivations with ordered rules, which differs from BNF's context-free rules.
What historians and scientists say
Panini anticipated many ideas of formal grammar by over two thousand years, but BNF was developed independently. The parallel is a tribute to Panini, not a line of descent.