Select a tag to browse associated projects and drill deeper into the tag cloud.
This is a (set of) perl module(s) that provide various transformations of Sanskrit nouns (and verbs), as well as transliteration from Roman to devanaagarii and Unicode.
The Regular Pattern Analyzer(RPA) is a top-down recursive parser and pattern matching engine. The input grammar notation is Backus–Naur Form (BNF) and the produced output is a browsable Abstract Syntax Tree (AST). The grammar allows Regular Expressions, so the parser can also be used as RegEx or ... [More]