We propose a model for the computer representation of the Paninian system of Sanskrit grammar. Based on this model, we render the grammatical data and simulate the rules of Astadhyayi on computer. We then employ these rules for generation of morpho-syntactical components of the language. These generated components we store in a p-subsequential automata. This we use to develop a lexicon on Paninian principles. We report briefly its implementation.