Abstract Vector symbolic architectures (VSA) are a viable approach for the hyperdimensional representation of data, such as documents, syntactic structures, or semantic frames. We present rigorous mathematical framework phrase structure trees and parse context-free grammars (CFG) in Fock space, i.e. infinite-dimensional Hilbert space being used quantum field theory. define novel normal form CFG...

SGStudio is a grammar authoring tool that eases semantic grammar development. It is capable of integrating different information sources and learning from annotated examples to induct CFG rules. In this paper, we investigate a modification to its underlying model by replacing CFG rules with n-gram statistical models. The new model is a composite of HMM and CFG. The advantages of the new model i...

Constructive methods for obtaining the regular grammar counterparts for some sub-classes of the context free grammars (cfg) have been investigated by many researchers. An important class of grammars for which this is always possible is the one-letter cfg. We show in this paper a new constructive method for transforming arbitrary one-letter cfg to an equivalent regular expression of star-height ...

Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[ 3-e) on a grammar G and a string w can be used to multiply m x m Boolean matrices in time O(m3-e/3). In the process we also provide a formal definition of parsing motivated by an informal notion due to Lang. Our result establishes one of the first lim...

Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such problem is the balancedness problem which decides whether or not the language of a given contextfree grammar (CFG) over a paired alphabet is balanced. Another important problem is the validation problem which decides whether or...

SGStudio is a grammar authoring tool that eases semantic grammar development. It is capable of integrating different information sources and learning from annotated examples to induct CFG rules. In this paper, we investigate a modification to its underlying model by replacing CFG rules with n-gram statistical models. The new model is a composite of HMM and CFG. The advantages of the new model i...

After surveying existing tools, we have decided to work on existing compiler backend ‘opt’, which obtained from Dr. Mueller. Originally it works for Sparc ISA. It has the functionalities of constructing control flow graph (CFG) and detecting loops from CFG. Also the program is scalable to add or remove existing analysis and optimization paths. We modified ‘opt’ so that it only enables CFG const...

Bug localization plays an important role in software maintenance. Traditional works treat the source code from lexical perspective, while some recent researches indicate that exploiting program structure is beneficial for improving bug localization. Control flow graph (CFG) a widely used representation, which essentially represents structure. Although using neural network feature learning strai...

Parikh’s theorem states that every Context Free Language (CFL) has the same Parikh image as that of a regular language. A finite state automaton accepting such a regular language is called a Parikh-equivalent automaton. In the worst case, the number of states in any non-deterministic Parikh-equivalent automaton is exponentially large in the size of the Context Free Grammar (CFG). We associate a...

Large cage and field studies were conducted to determine the efficacy of various models of propane-powered mosquito traps. These traps utilized counterflow technology in conjunction with catalytic combustion to produce attractants (carbon dioxide, water vapor, and heat) and a thermoelectric generator that converted excess heat into electricity for stand-alone operation. The cage studies showed ...