Results 1 to 10 of about 290,995 (337)
Translations on a context free grammar [PDF]
Information and Control, 1969 Two schemes for the specification of translations on a context-free grammar are proposed. The first scheme, called a generalized syntax directed translation (GSDT), consists of a context free grammar with a set of semantic rules associated with each production of the grammar.
Alfred V. Aho, Jeffrey D. Ullman
core +6 more sources
Implicit learning of recursive context-free grammars. [PDF]
PLoS ONE, 2012 Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed
Martin Rohrmeier +2 more
doaj +6 more sources
LPG–PCFG: An Improved Probabilistic Context- Free Grammar to Hit Low-Probability Passwords [PDF]
Sensors, 2022 With the development of the Internet, information security has attracted more attention. Identity authentication based on password authentication is the first line of defense; however, the password-generation model is widely used in offline password ...
Xiaozhou Guo +4 more
doaj +2 more sources
Learning of Structurally Unambiguous Probabilistic Grammars [PDF]
Logical Methods in Computer Science, 2023 The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule.
Dana Fisman +2 more
doaj +2 more sources
On a property of probabilistic context-free grammars [PDF]
International Journal of Mathematics and Mathematical Sciences, 1983 It is proved that for a probabilistic context‐free language L(G), the population density of a character (terminal symbol) is equal to its relative density in the words of a sample S from L(G) whenever the production probabilities of the grammar G are estimated by the relative frequencies of the corresponding productions in the sample.
Ranjan Chaudhuri, A.N.V. Rao
openalex +6 more sources
A stochastic context free grammar based framework for analysis of protein sequences [PDF]
BMC Bioinformatics, 2009 Background In the last decade, there have been many applications of formal language theory in bioinformatics such as RNA structure prediction and detection of patterns in DNA.
Nebel Jean-Christophe, Dyrka Witold
doaj +2 more sources
Analyzing ambiguity of context-free grammars [PDF]
BRICS Report Series, 2009 <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.
Claus Brabrand +2 more
openalex +9 more sources
On Müller context-free grammars
Theoretical Computer Science, 2011 AbstractWe define context-free grammars with Müller acceptance condition that generate languages of countable words. We establish several elementary properties of the class of Müller context-free languages including closure properties and others. We show that every Müller context-free grammar can be transformed into a normal form grammar in polynomial ...
Zoltán Ésik, Szabolcs Iván
openalex +4 more sources
Context-Free Grammars with Storage [PDF]
arXiv, 2014 Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an object of type S is associated, that can be acted upon by tests and operations, as indicated in the rules of the ...
arxiv +3 more sources
Split-Based Algorithm for Weighted Context-Free Grammar Induction
Applied Sciences, 2021 The split-based method in a weighted context-free grammar (WCFG) induction was formalised and verified on a comprehensive set of context-free languages. WCFG is learned using a novel grammatical inference method. The proposed method learns WCFG from both
Mateusz Gabor +2 more
doaj +1 more source