Results 11 to 20 of about 318,670 (335)
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
Grammar Compression with Probabilistic Context-Free Grammar [PDF]
2020 Data Compression Conference (DCC), 2020 We propose a new approach for universal lossless text compression, based on grammar compression. In the literature, a target string $T$ has been compressed as a context-free grammar $G$ in Chomsky normal form satisfying $L(G) = \{T\}$. Such a grammar is often called a \emph{straight-line program} (SLP).
Naganuma, Hiroaki +4 more
openaire +2 more sources
Undecidable problems concerning densities of languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In this paper we prove that the question whether a language presented by a context free grammar has density, is undecidable. Moreover we show that there is no algorithm which, given two unambiguous context free grammars on input, decides whether the ...
Jakub Kozik
doaj +1 more source
Mathematics, 2022 The limitations of traditional parsing architecture are well known. Even when paired with parsing methods that accept all context-free grammars (CFGs), the resulting combination for any given CFG accepts only a limited subset of corresponding character ...
Žiga Leber +3 more
doaj +1 more source
A Context-Free Grammar Associated with Fibonacci and Lucas Sequences
Journal of Mathematics, 2023 We introduce a context-free grammar G=s⟶s+d,d⟶s to generate Fibonacci and Lucas sequences. By applying the grammar G, we give a grammatical proof of the Binet formula.
Harold Ruilong Yang
doaj +1 more source
Multiple Context-Free Tree Grammars: Lexicalization and Characterization [PDF]
, 2017 Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one ...
Engelfriet, Joost +2 more
core +3 more sources
Algorithms, 2016 LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source
Synthesis of nested loop exercises for practice in introductory programming
Egyptian Informatics Journal, 2023 Novice programmers struggle to comprehend specific programming constructs such as arrays, recursion, and loops. One way to address this challenge is to provide practice problems for students in these topics that are considered difficult to comprehend ...
Chinedu Wilfred Okonkwo +1 more
doaj +1 more source
Restricted Global Grammar Constraints [PDF]
, 2009 We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as hard as parsing ...
Katsirelos, George +3 more
core +3 more sources
On Restricted Context-Free Grammars
Journal of Computer and System Sciences, 2010 The contribution investigates the generative power of several derivation-restricted context-free grammars. Many derivation restriction mechanisms for context-free grammars have already been studied in the literature, and the current contribution investigates a restriction on the non-terminals that allows/disallows the application of a production ...
Dassow, J., Masopust, T. (Tomáš)
openaire +4 more sources