http://plero.fei.tuke.sk/ 2026-07-20T22:08:12+02:00 http://plero.fei.tuke.sk/ http://plero.fei.tuke.sk/lib/tpl/dokuwiki-mod/images/favicon.ico text/html 2013-05-28T14:41:22+02:00 http://plero.fei.tuke.sk/doku.php?id=grammar-language&rev=1369744882&do=diff Grammars for pLERO are written in a simple format based on BNF. Each rule has the following form: [nonterminal] ::= [sequence_of_terminals_and_nonterminals] Terminals must be enclosed in apostrophes. Examples Expression language Expr ::= Expr '+' Expr Expr ::= Expr '-' Expr Expr ::= Expr '*' Expr Expr ::= Expr '/' Expr Expr ::= Term Term ::= Int Term ::= '(' Expr ')' Int ::= N Int ::= N Int N ::= '0' N ::= '1' N ::= '2' N ::= '3' N ::= '4' N ::= '5' N ::= '6' N ::= '7' N ::= '8' N ::= '9… text/html 2013-05-21T10:55:24+02:00 http://plero.fei.tuke.sk/doku.php?id=plero-language&rev=1369126524&do=diff pLERO is the pattern Language of Extended Refactoring Operators. Through pLERO it is possible to define patterns for grammar refactoring or other transformations, applicable to grammars expressed in BNF. That is, pLERO is a language for defining parameterless operators of a problem class. text/html 2013-05-28T15:03:11+02:00 http://plero.fei.tuke.sk/doku.php?id=start&rev=1369746191&do=diff pLERO is a formal specification language for preserving knowledge of grammar engineers, complementing mARTINICA, the universal approach for automated refactoring of context-free grammars. Download Experimental implementation of pLERO pattern application system: [pLERO version 0.1]