Filters








6,929 Hits in 9.2 sec

Ensuring the Correctness of Regular Expressions: A Review

Li-Xiao Zheng, Shuai Ma, Zu-Xi Chen, Xiang-Yu Luo
2021 International Journal of Automation and Computing  
However, regular expressions have a quite compact and rather tolerant syntax that makes them hard to understand, hard to compose, and error-prone.  ...  In this study, we provide a review of the recent works for ensuring the correct usage of regular expressions.  ...  Acknowledgements This work was supported by National Natural Science Foundation of China (Nos. 61872339, 61502184 and 61925203).  ... 
doi:10.1007/s11633-021-1301-4 fatcat:yyeganl2dnah7mbbbo3j2z4u4u

The metafront System

Claus Brabrand, Michael I. Schwartzbach, Mads Vanggaard
2003 Electronical Notes in Theoretical Computer Science  
Our tool may be used as a parser generator in which the resulting parser automatically supports a flexible, safe, and efficient macro processor, or as an extensible lightweight compiler generator for domain-specific  ...  We rely on a novel parser algorithm that is designed to support gradual extensions of a grammar by allowing productions to remain in a natural style and by statically reporting ambiguities and errors in  ...  Comments and Whitespace Comments and whitespace are handled through a special terminal, omit, that may be assigned a regular expression of tokens to omit.  ... 
doi:10.1016/s1571-0661(05)82630-1 fatcat:sys5hb6havf23hyebcu54yitcu

PR-OWL: A Bayesian Ontology Language for the Semantic Web [chapter]

Paulo Cesar G. da Costa, Kathryn B. Laskey, Kenneth J. Laskey
2008 Lecture Notes in Computer Science  
, thus representing an important step toward the W3C's vision for the Semantic Web.  ...  This paper addresses a major weakness of current technologies for the Semantic Web, namely the lack of a principled means to represent and reason about uncertainty.  ...  the representation of the conditional probability tables (CPT) to express a tractable and expressive subset of first-order logic; and/or (iii) to employ a standard semantic web language syntax to represent  ... 
doi:10.1007/978-3-540-89765-1_6 fatcat:azbyns4ftfdlvbunfm4kr2mceu

The METAFRONT System: Extensible Parsing and Transformation

Claus Brabrand, Michael I. Schwartzbach, Mads Vanggaard
2003 BRICS Report Series  
<br /> <br />Our tool may be used as a parser generator in which the resulting parser automatically supports a flexible, safe, and efficient macro processor, or as an extensible lightweight compiler generator  ...  for domain-specific languages.  ...  Comments and Whitespace Comments and whitespace are handled through a special terminal, omit, that may be assigned a regular expression of tokens to omit.  ... 
doi:10.7146/brics.v10i7.21778 fatcat:tqg7sc4hsfgyld7uwbbnu37ppa

Formal Methods of Transformations (Dagstuhl Seminar 17142)

Emmanuel Filiot, Sebastian Maneth, Helmut Seidl, Marc Herbstritt
2017 Dagstuhl Reports  
This seminar was motivated by recent advances and breakthrough results, both in the settings of words and trees.  ...  The goal of this Dagstuhl seminar was to gather researchers working on the theory and practice of transformations (also know as transductions) of word and tree structures, which are realised by transducers  ...  Finally, Krishna S. concluded the seminar by sketching an alternative proof of a result by Alur et. al. on regular expressions for string transformations.  ... 
doi:10.4230/dagrep.7.4.23 dblp:journals/dagstuhl-reports/FiliotMS17 fatcat:2kwm6o7h2banfjp5y5nb4wimvm

Yaccscript

John Healey
2006 Proceedings of the 44th annual southeast regional conference on - ACM-SE 44  
This paper describes Yaccscript, an extensible platform for compiling languages to a common framework, and demonstrates its effectiveness at providing interoperability between object-oriented, functional  ...  Programming paradigms are often skewed towards a particular domain of problems, thus one effective way to utilize them is through a multiparadigm approach to software development.  ...  The Lexer and Parser Generators The lexer generator compiles a Lisp list into a block of code that can be used to process regular expressions 3 .  ... 
doi:10.1145/1185448.1185598 dblp:conf/ACMse/Healey06 fatcat:v6tujnsuhrh4xmsxckjbiqnuze

Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic

David Harel
1980 Theoretical Computer Science  
Emphasis is placed on the tradeoff existing between data-directed and syntax-directed methods, and on providing, especially for the latter, a uniform description enabling comparison and assessment.  ...  The simple set WL of deterministic while programs is defined iand a number of known methods for proving the correctness of these programs are surveyed.  ...  Manna, A. R. Meyer, V. R. Pratt and A. Shamir for many helpful conversations and comments. The constructive remarks of A.  ... 
doi:10.1016/0304-3975(80)90005-5 fatcat:j3m6gmtor5c3hpzepagoyi6q3m

Generalizing input-driven languages: theoretical and practical benefits [article]

Dino Mandrioli, Matteo Pradella
2017 arXiv   pre-print
Floyd pioneered deterministic parsing, and we show that they offer unexpected properties in two fields so far investigated in totally independent ways: they enable parsing parallelization in a more effective  ...  way than traditional sequential parsers, and exhibit the same algebraic and logic properties so far obtained only for less expressive language families.  ...  We acknowledge the contribution to our research given by Alessandro Barenghi, Stefano Crespi Reghizzi, Violetta Lonati, Angelo Morzenti, and Federica Panella.  ... 
arXiv:1705.00984v1 fatcat:pnwhigq2q5httky7x7omvf67ri

Narrowing Down XML Template Expansion and Schema Validation [article]

René Haberland
2021 arXiv   pre-print
Properties towards their practical meaning are probed, an implementation is developed. Requirements for an unification are elaborated and a comparison is taken out.  ...  An explanation was given, why filters and arrows are not best, especially towards a unified language to be variable and extensive. Recommendations for future language design are provided.  ...  That is why this grammar is not ranked-competing. 3) Regular Tree Languages: Regular Tree Languages are formal languages generated by RHG, hedge-regular expressions and deterministic and non-deterministic  ... 
arXiv:1912.10816v2 fatcat:mbz4sp4egbar7ceysa7qu4vkru

Introduction to the Report "Interlanguages and Synchronic Models of Computation." [article]

Alexander Victor Berka
2010 arXiv   pre-print
A compiler for an interlanguage called Space, has been developed for the Synchronic A-Ram. Space is MIMD. strictly typed, and deterministic.  ...  An interstring linked with a abstract machine environment, shares sub-expressions, transfers data, and spatially allocates resources for the parallel evaluation of dataflow.  ...  A compiler for an interlanguage called Space, has been developed for the Synchronic A-Ram. Space is MIMD. strictly typed, and deterministic.  ... 
arXiv:1005.4798v2 fatcat:6xv47hmfyfe4jgpd5nookzsqo4

The metafront system: Safe and extensible parsing and transformation

Claus Brabrand, Michael I. Schwartzbach
2007 Science of Computer Programming  
Our tool may be used as a parser generator in which the resulting parser automatically supports a flexible, safe, and efficient macro processor, or as an extensible lightweight compiler generator for domain-specific  ...  We rely on a novel parser algorithm that is designed to support gradual extensions of a grammar by allowing productions to remain in a natural style and by statically reporting ambiguities and errors in  ...  Acknowledgments The authors would like to thank Mads Vanggaard for his experiments with parsing, extending, and transforming Java using metafront in conjunction with his Master's thesis.  ... 
doi:10.1016/j.scico.2005.06.007 fatcat:ain4kr3dlbf6bmcxnwx6jaqq3q

A Typeful Integration of SQL into Curry

Michael Hanus, Julia Krone
2017 Electronic Proceedings in Theoretical Computer Science  
In addition to standard SQL, SQL statements embedded in Curry can include program expressions and also relationships specified in the ER model.  ...  As a result, our SQL integration supports a high-level and type-safe access to databases in Curry programs.  ...  The authors are grateful to Jasper Paul Sikorra for the implementation of the foreign code integrator and Mike Tallarek for implementing the initial version of the CDBI libraries.  ... 
doi:10.4204/eptcs.234.8 fatcat:jb6vvvo5ebhcpcz7su7sivonti

Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data

Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren
2010 ACM Transactions on the Web  
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of positive example words  ...  The regular expressions occurring in practical DTDs and XSDs, however, are such that every alphabet symbol occurs only a small number of times.  ...  For the purpose of inferring DTDs and XSDs from XML data, we are hence in search of an algorithm that, given enough sample words of a target deterministic regular expression r, returns a deterministic  ... 
doi:10.1145/1841909.1841911 fatcat:hre7agfyuzhudl3xwlaxxd4xg4

Learning deterministic regular expressions for the inference of schemas from XML data

Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn Vansummeren
2008 Proceeding of the 17th international conference on World Wide Web - WWW '08  
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of positive example words  ...  The regular expressions occurring in practical DTDs and XSDs, however, are such that every alphabet symbol occurs only a small number of times.  ...  For the purpose of inferring DTDs and XSDs from XML data, we are hence in search of an algorithm that, given enough sample words of a target deterministic regular expression r, returns a deterministic  ... 
doi:10.1145/1367497.1367609 dblp:conf/www/BexGNV08 fatcat:bqs6npqyi5eaxlzv5n3ktgb6di

Generalizing input-driven languages: Theoretical and practical benefits

Dino Mandrioli, Matteo Pradella
2018 Computer Science Review  
Floyd pioneered deterministic parsing, and we show that they offer unexpected properties in two fields so far investigated in totally independent ways: they enable parsing parallelization in a more effective  ...  way than traditional sequential parsers, and exhibit the same algebraic and logic properties so far obtained only for less expressive language families.  ...  We also thank the anonymous reviewers for their careful reading and valuable suggestions.  ... 
doi:10.1016/j.cosrev.2017.12.001 fatcat:snlz2nh3sbgctiaza7nedipzue
« Previous Showing results 1 — 15 out of 6,929 results