This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in the underlying unlabled graph. These results build directly on an algorithm of Barrett, Jacob, and Marathe [1]. In addition to many other results, they gave a shortest path algorithm for CFG labeled ...

Evolutionary methods aff ord a productive and creative alternative design workfl ow. Crucial to success is the choice of formal representation of the problem. String-rewriting context-free grammars (CFGs) are one common option in evolutionary computation, but their suitability for design is not obvious. Here, a CFG-based evolutionary algorithm for design is presented. The process of meta-design...

This document contains a comparison of two BGP yang models: draftzhdankin-netmod-bgp-cfg-01 and draft-wang-i2rs-bgp-dm. The yang model in draft-zhdankin-netmod-bgp-cfg-01 is a model focused on configuration. The yang model in draft-wang-i2rs-bgp-dm-00 is focused on the status and ephemeral state changes needed for the I2RS interface. The conclusion of comparison is that there little overlap exc...

It is well-known that the class of lattices generated by Chip Firing games (CFGs) is strictly included in the class of upper locally distributive lattices (ULD). However a necessary and sufficient criterion for this class is still an open question. In this paper we settle this problem by giving such a criterion. This criterion provides a polynomial-time algorithm for constructing a CFG which ge...

Posing a bright example of the integration of the CFG Participating Investigators (PIs) and Scientific Cores, the Analytical Glycotechnology Core (C) has launched an exciting initiative inviting the PIs to supply purified populations of human and murine immune cells for glycomic analysis. The response to this invitation showed how important and timely this initiative was to the scientific commu...

Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however, too many structures are produced, and therefore its parsing speed becomes very slow. This paper describes a technique for efficient incremental parsing using lexical information. The probability concerning dependencie...

This paper addresses the issue of recovering a both safe and precise approximation of the Control Flow Graph (CFG) of an unstructured program, typically an executable file. The problem is tackled in an original way, with a refinement-based static analysis working over finite sets of constant values. Requirement propagation allows the analysis to automatically adjust the domain precision only wh...

Most of the parsers deened for TAG (Tree Adjoining Grammar) formalism are based in classical CFG (Context-Free Grammar) parsers. An elementary tree is considered a set of CFG-rules and adjunction operation is simulated by substitution. Additional control considerations must be added in order to establish the real power of TAGs. In this paper, we present one elementary tree representation for TA...

This paper reports on the implementation of the Latvian grammar checker. It gives a brief introduction of the project scope – Latvian language, the previous implementation of the grammar checker and its limitations. Then, it describes the proposed approach. This paper also describes the Latvian parser used for this project and the quality measurement methods used for the quality assessment of t...

This paper describes a language modeling technique using a kind of stochastic context free grammar (stochastic dependency grammar, SDG). In this work, two improvements are done upon the general CFG based SCFG model. The rst improvement is to use a restricted grammar instead of general CFG. The dependency grammar used here is a restricted CFG that expresses modi cation between two words or phras...