![]() |
![]() |
:: Via malfidinda reta dokumento de referenco pri la Skarpac. :: |
Navigation: > [Home page] > [papers] > [Formal Languages] | [Alphabetical Index] [Tree View] |
Local contents:
![]() |
File : | computer_lang.pdf | 235 kbytes | 2002-07-12 |
Title: | Associative Definition of Programming Languages | |||
Authors: | Stefano Crespi Reghizzi, Matteo Pradella and Pierluigi San Pietro | |||
Abstract: | Associative Language Descriptions are a recent grammar model, theoretically less pow- erful than Context Free grammars, but adequate for describing the syntax of pro- gramming languages. ALD do not use nonterminal symbols, but rely on permissible contexts for specifying valid syntax trees. In order to assess ALD adequacy, we analyze the descriptional complexity of structurally equivalent CF and ALD grammars, find- ing comparable measures. The compression obtained using CF copy rules is matched by context inheritance in ALD. The family of hierarchical parentheses languages, an abstract paradigm of HTML, and of expressions with operator precedences is studied. A complete ALD grammar of Pascal testifies of the practicality of the ALD approach. | |||
![]() |
File : | extending-formal-languages-hierarchies.pdf | 116 kbytes | 2004-11-04 |
![]() |
File : | fateman96progress.ps.gz | 170 kbytes | 2003-05-03 |
![]() |
File : | fateman99how.ps.gz | 1.35 Mbytes | 2003-05-03 |
![]() |
File : | GiammarresiRestivo96.ps | 467 kbytes | 2003-03-07 |
Title: | Two-dimensional languages | |||
Authors: | Dora Giammarresi, Antorio Restivo | |||
![]() |
File : | lindgren00complexity.ps | 582 kbytes | 2004-11-04 |
![]() |
File : | Matz97.ps | 157 kbytes | 2003-03-24 |
Title: | Regular Expressions and Context-Free Grammars for Picture Languages | |||
![]() |
File : | matz97regular.pdf | 211 kbytes | 2003-03-21 |
![]() |
File : | rectangles-and-squares-recognized.ps | 387 kbytes | 2004-11-04 |
![]() |
File : | reinhardt98some.ps | 357 kbytes | 2004-11-04 |
![]() |
File : | simplot99characterization.pdf | 254 kbytes | 2004-06-17 |
![]() |
File : | simplot99characterization.ps | 1.35 Mbytes | 2004-06-17 |
![]() |
File : | Tile Rewriting Grammars.pdf | 135 kbytes | 2003-04-03 |
Title: | Tile Rewriting Grammars | |||
Authors: | Stefano Crespi Reghizzi and Matteo Pradella | |||
Abstract: | Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free grammars so successful for 1D languages. In a renewed attempt, a model named Tile Rewriting Grammar is introduced combining the rewriting rules with the Tiling System of Giammaresi and Restivo which define the family of Recognizable 2D languages. The new grammars have isometric rewriting rules which for string languages are equivalent to CF rules. TRG have the capacity to generate a sort of 2D analogues of Dyck languages. Closure properties of TRG are proved for some basic operations. TRG strictly include TS as well as the context-free picture grammars of Matz. | |||
![]() |
File : | yeung.ijdar2000.ps | 261 kbytes | 2003-05-03 |
Title: | Mathematical Expression Recognition: A Survey | |||
Authors: | Chan, Yeung | |||
![]() |
File : | zhang01contextsensitive.pdf | 309 kbytes | 2003-05-03 |
Title: | A context-sensitive graph grammar formalism for the specification of visual languages. | |||
Authors: | D. Zhang, K. Zhang and J. Cao |
Navigation: > [Home page] > [papers] > [Formal Languages] | [Alphabetical Index] [Tree View] |
![]() |
This page was last updated on 2004-12-26 at 18:22:43. This site was automagically generated by MajaMaja, a simple and easy to use web content manager written in Tcl by scarpaz <scarpaz@scarpaz.com>. |