Venpa (வெண்பா in Tamil) is a form of classical tamil poetry. Classical Tamil poetry has been classifed based upon the rules of metric prosody. Such rules form a context-free grammar
A set of well defined metric rules define the grammar for Venpa. Such rules have been proved to form a Context-free grammar. One set of rules constrains the duration of sound for each word or cheer, while another set of rules defines the rules for the possible sounds at the beginning of a word that follows a given sound at the end of the preceding word
Venpa (வெண்பா in Tamil) is a form of classical tamil poetry. Classical Tamil poetry has been classifed based upon the rules of metric prosody. Such rules form a context-free grammar. Every Venpa consists between two to twelve lines.
Venpa - Popular books written in Venpa style.
All 1330 couplets from Tirukkural, composed by Tiruvalluvar are examples of Venpa. Tirukkural comes under a sub-category of Venpa called Kural Venpa, wherein each Kural has only two lines.
Nala venpa ...
Including:
A set of well defined metric rules define the grammar for Venpa. Such rules have been proved to form a Context-free grammar.
One set of rules constrains the duration of sound for each word or cheer, while another set of rules defines the rules for the possible sounds at the beginning of a word that follows a given sound at the end of the preceding word. Any Venpa should conform to both these sets of rules.
Following is the set of produ ...
The Backus-Naur form (BNF) (also known as Backus normal form) is a metasyntax used to express context-free grammars: that is, a formal way to describe formal languages. BNF is widely used as a notation for the grammars of computer programming languages, command sets and communication protocols. They can also be used as a notation for representing parts of natural language grammars. For example see the grammar for meter in Venpa poetry. Most textbooks for programming language theory and/or semantics document the programming language in BNF. Some va ...
Including:
A couplet is a pair of lines of verse that form a unit. Most couplets rhyme aa, but this is not a requirement.
Poetry in rhyming couplets is one of the simplest rhyme schemes:
aa bb cc dd ee ff... etc.
Example:
I THINK that I shall never see a
A poem as lovely as a tree. a
A tree whose hungry mouth is prest b
Against th ...
In linguistics and computer science, a context-free grammar (CFG) is a formal grammar in which every production rule is of the form
V → w
where V is a non-terminal symbol and w is a string consisting of terminals and/or non-terminals. The term "context-free" comes from the fact that the non-terminal V can always be replaced by w, regardless of the context in which it occurs. A formal language is context ...
Including:
Poetry (ancient Greek: ποιεω (poieo) = I create) is traditionally a written art form (although there is also an ancient and modern poetry which relies mainly upon oral or pictorial representations) in which human language is used for its aesthetic qualities in addition to, or instead of, its notional and semantic content. The increased emphasis on the aesthetics of language and the deliberate use of features such as repetition, meter and rhyme, are what are commonly used to distinguish poetry from prose, but debates over s ...
Including:
Bharathidasan (April 29, 1891 - April 1, 1964; also spelt Bharatidasan) was a twentieth century Tamil poet and rationalist whose literary works handled mostly socio-political issues. His writings served as a catalyst for the growth of the Dravidian movement in Tamil Nadu. In addition to poetry, his views found expression in other forms such as plays, film scripts, short stories and essays. He was mentored by Mahakavi Subramanya Bharathi (after whom he called himself "Bharathidasan"). But Bharathidasan, unlike Bharathi rarely us ...
Including:
Just as any formal grammar, a context-free grammar G can be defined as a 4-tuple:
G = (Vt,Vn,P,S) where
Vt is a finite set of terminals
Vn is a finite set of non-terminals
P is a finite set of productions rules
S is an e ...
Every context-free grammar which does not generate the empty string can be transformed into an equivalent one in Chomsky normal form or Greibach normal form. "Equivalent" here means that the two grammars generate the same language.
Because of the especially simple form of production rules in Chomsky Normal Form grammars, this normal form has both theoretical and practical implications. For instance, given a context-free grammar, one can use the Chomsky Normal Form to construct a polynomial-time algorithm which decides whether a given string is in the language re ...
Bharathidasan penned his works under different pseudonyms such as Puduvai Kalaimakal, Desopakari, Desabhaktan, Anantapotini, Swadesamitiran, Tamilarasu, Tupleks, Kirukkan, Kindalkaran and the name by which he known today - Bharathidasan.
His works include
Srimayilam Suppiramaniar Thuthiyamuthu
Sanjivi Parvathin Saaral
Edhirpaaraadha Mutham
Kaadhal Ninaivugal
Nalla Theerppu
Alagin Sirippu
Kudumba Vilakku
Pandi ...
There are many variants and extensions of BNF, possibly containing some or all of the regexp wild cards such as "*" or "+". The Extended Backus-Naur form (EBNF) is a common one. In fact the example above is not the pure form invented for the ALGOL 60 report. The bracket notation "[ ]" was introduced a few years later in IBM's PL/I definition but is now universally recognised. ABNF is another extension commonly used to describe IETF protocols.
Parsing expression grammars build on the BNF and regular expression notations to form an alternative class of formal grammar, which is essentially ...
