Efficient generation of random sentences

1996 ◽  
Vol 2 (1) ◽  
pp. 1-13 ◽  
Author(s):  
MARK-JAN NEDERHOF
Keyword(s):  
Static Analysis ◽  
Finite Domain ◽  
Random Generation ◽  
Efficient Generation ◽  
Parameter Values ◽  
Context Free ◽  
Context Free Grammars

We discuss the random generation of strings using the grammatical formalism AGFL. This formalism consists of context-free grammars extended with a parameter mechanism, where the parameters range over a finite domain. Our approach consists in static analysis of the combinations of parameter values with which derivations can be constructed. After this analysis, generation of sentences can be performed without backtracking.

scholarly journals Static Analysis for Java Servlets and JSP

2006 ◽  
Vol 13 (10) ◽  
Author(s):  
Christian Kirkegaard ◽  
Anders Møller
Keyword(s):  
Static Analysis ◽  
Program Analysis ◽  
Web Applications ◽  
Control Flow ◽  
Analysis Techniques ◽  
Session State ◽  
Context Free ◽  
Context Free Grammars

We present an approach for statically reasoning about the behavior of Web applications that are developed using Java Servlets and JSP. Specifically, we attack the problems of guaranteeing that all output is well-formed and valid XML and ensuring consistency of XHTML form fields and session state. Our approach builds on a collection of program analysis techniques developed earlier in the JWIG and X<small>ACT</small> projects, combined with work on balanced context-free grammars. Together, this provides the necessary foundation concerning reasoning about output streams and application control flow.

scholarly journals Static Analysis for Java Servlets and JSP

2006 ◽  
Vol 13 (8) ◽  
Author(s):  
Christian Kirkegaard ◽  
Anders Møller
Keyword(s):  
Static Analysis ◽  
Program Analysis ◽  
Web Applications ◽  
Control Flow ◽  
Analysis Techniques ◽  
Session State ◽  
Context Free ◽  
Context Free Grammars

We present an approach for statically reasoning about the behavior of Web applications that are developed using Java Servlets and JSP. Specifically, we attack the problems of guaranteeing that all output is well-formed and valid XML and ensuring consistency of XHTML form fields and session state. Our approach builds on a collection of program analysis techniques developed earlier in the JWIG and X<small>ACT</small> projects, combined with work on balanced context-free grammars. Together, this provides the necessary foundation concerning reasoning about output streams and application control flow.

scholarly journals Analyzing Ambiguity of Context-Free Grammars

2006 ◽  
Vol 13 (9) ◽  
Author(s):  
Claus Brabrand ◽  
Robert Giegerich ◽  
Anders Møller
Keyword(s):  
Static Analysis ◽  
Real World ◽  
Full Text ◽  
Language Design ◽  
Rna Analysis ◽  
Parser Generation ◽  
Context Free ◽  
Linguistic Characterization ◽  
Context Free Grammars

<p>It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures. However, the fact that the problem is undecidable does not mean that there are no useful <em>approximations</em> to the problem.<br /> <br />We observe that there is a simple linguistic characterization of the grammar ambiguity problem, and we show how to exploit this to conservatively approximate the problem based on local regular approximations and grammar unfoldings. As an application, we consider grammars that occur in RNA analysis in bioinformatics, and we demonstrate that our static analysis of context-free grammars is sufficiently precise and efficient to be practically useful.</p><p> </p><p>Full text: <a href="http://dx.doi.org/10.1016/j.scico.2009.11.002" target="_self">http://dx.doi.org/10.1016/j.scico.2009.11.002</a></p>

scholarly journals Analyzing Ambiguity of Context-Free Grammars

2007 ◽  
Vol 14 (10) ◽  
Author(s):  
Claus Brabrand ◽  
Robert Giegerich ◽  
Anders Møller
Keyword(s):  
Static Analysis ◽  
Real World ◽  
Language Design ◽  
Rna Analysis ◽  
Parser Generation ◽  
Context Free ◽  
Linguistic Characterization ◽  
Context Free Grammars

It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures.<br /> <br />We observe that there is a simple linguistic characterization of the grammar ambiguity problem, and we show how to exploit this to conservatively approximate the problem based on local regular approximations and grammar unfoldings. As an application, we consider grammars that occur in RNA analysis in bioinformatics, and we demonstrate that our static analysis of context-free grammars is sufficiently precise and efficient to be practically useful.

Sign in / Sign up

Export Citation Format

Share Document