Academic literature on the topic 'Context-free grammars and languages'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Context-free grammars and languages.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Context-free grammars and languages"

1

Turaev, Sherzod, Rawad Abdulghafor, Ali Amer Alwan, Ali Abd Almisreb, and Yonis Gulzar. "Binary Context-Free Grammars." Symmetry 12, no. 8 (2020): 1209. http://dx.doi.org/10.3390/sym12081209.

Full text
Abstract:
A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a set of pairs of productions and the pair of the initial nonterminals that generates the binary relation, i.e., the set of pairs of strings over the terminal alphabets. This paper investigates the binary context-free grammars as mutually controlled grammars: two context-free grammars generate strings imposing restrictions on selecting production rules to be applied in derivations. The paper shows that binary context-free grammars can generate matrix languages whereas binary regular and linear grammars have the same power as Chomskyan regular and linear grammars.
APA, Harvard, Vancouver, ISO, and other styles
2

Fong, Wan Heng, Aqilahfarhana Abdul Rahman, Nor Haniza Sarmin, and Sherzod Turaev. "Static Watson-Crick Context-Free Grammars." International Journal of Online and Biomedical Engineering (iJOE) 15, no. 10 (2019): 65. http://dx.doi.org/10.3991/ijoe.v15i10.10878.

Full text
Abstract:
Sticker systems and Watson-Crick automata are two modellings of DNA molecules in DNA computing. A sticker system is a computational model which is coded with single and double-stranded DNA molecules; while Watson-Crick automata is the automata counterpart of sticker system which represents the biological properties of DNA. Both of these models use the feature of Watson-Crick complementarity in DNA computing. Previously, the grammar counterpart of the Watson-Crick automata have been introduced, known as Watson-Crick grammars which are classified into three classes: Watson-Crick regular grammars, Watson-Crick linear grammars and Watson-Crick context-free grammars. In this research, a new variant of Watson-Crick grammar called a static Watson-Crick context-free grammar, which is a grammar counterpart of sticker systems that generates the double-stranded strings and uses rule as in context-free grammar, is introduced. The static Watson-Crick context-free grammar differs from a dynamic Watson-Crick context-free grammar in generating double-stranded strings, as well as for regular and linear grammars. The main result of the paper is to determine the generative powers of static Watson-Crick context-free grammars. Besides, the relationship of the families of languages generated by Chomsky grammars, sticker systems and Watson-Crick grammars are presented in terms of their hierarchy.
APA, Harvard, Vancouver, ISO, and other styles
3

JEŻ, ARTUR. "CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES." International Journal of Foundations of Computer Science 19, no. 03 (2008): 597–615. http://dx.doi.org/10.1142/s012905410800584x.

Full text
Abstract:
Conjunctive grammars, introduced by Okhotin, extend context-free grammars by an additional operation of intersection in the body of any production of the grammar. Several theorems and algorithms for context-free grammars generalize to the conjunctive case. Okhotin posed nine open problems concerning those grammars. One of them was a question, whether a conjunctive grammars over a unary alphabet generate only regular languages. We give a negative answer, contrary to the conjectured positive one, by constructing a conjunctive grammar for the language {a4n : n ∈ ℕ}. We also generalize this result: for every set of natural numbers L we show that {an : n ∈ L} is a conjunctive unary language, whenever the set of representations in base-k system of elements of L is regular, for arbitrary k.
APA, Harvard, Vancouver, ISO, and other styles
4

Teichmann, Markus. "Regular Approximation of Weighted Linear Context-Free Tree Languages." International Journal of Foundations of Computer Science 28, no. 05 (2017): 523–42. http://dx.doi.org/10.1142/s0129054117400056.

Full text
Abstract:
We show how to train a weighted regular tree grammar such that it best approximates a weighted linear context-free tree grammar concerning the Kullback–Leibler divergence between both grammars. Furthermore, we construct a regular tree grammar that approximates the tree language induced by a context-free tree grammar.
APA, Harvard, Vancouver, ISO, and other styles
5

Fong, Wan Heng, Aqilahfarhana Abdul Rahman, Nor Haniza Sarmin, and Sherzod Turaev. "Computational Power of Static Watson-Crick Context-free Grammars." Science Proceedings Series 1, no. 2 (2019): 82–85. http://dx.doi.org/10.31580/sps.v1i2.679.

Full text
Abstract:
Sticker system is a computer model which is coded with single and double-stranded molecules of DNA; meanwhile, Watson-Crick automata is the automata counterpart of the sticker system representing the biological properties of DNA. Both are the modelings of DNA molecules in DNA computing which use the feature of Watson-Crick complementarity. Formerly, Watson-Crick grammars which are classified into three classes have been introduced [1]. In this research, a grammar counterpart of sticker systems that uses the rule as in context-free grammar is introduced, known as a static Watson-Crick context-free grammar. The research finding on the computational power of these grammar shows that the family of context-free languages is strictly included in the family of static Watson-Crick context-free languages; the static Watson-Crick context-free grammars can generate non context-free languages; the family of Watson-Crick context-free languages is included in the family of static Watson-Crick context-free languages which are presented in terms of their hierarchy.
APA, Harvard, Vancouver, ISO, and other styles
6

Mäkinen, Erkki. "On Pure Context-Free Languages and Left Szilard Languages." Fundamenta Informaticae 15, no. 1 (1991): 86–89. http://dx.doi.org/10.3233/fi-1991-15107.

Full text
Abstract:
It is shown that left Szilard languages of context-free grammars are pure context-free languages. This is one of the few exceptions among the numerous negative results concerning the generative capacity of pure languages. Moreover, we characterize pure context-free languages and left Szilard languages of pure context-free grammars as certain homomorphic images.
APA, Harvard, Vancouver, ISO, and other styles
7

Nagy, Benedek. "Derivation "Trees" and Parallelism in Chomsky-Type Grammars." Triangle, no. 8 (June 29, 2018): 101. http://dx.doi.org/10.17345/triangle8.101-120.

Full text
Abstract:
In this paper we discuss parallel derivations for context-free, contextsensitive and phrase-structure grammars. For regular and linear grammars only sequential derivation can be applied, but a kind of parallelism is present in linear grammars. We show that nite languages can be generated by a recursion-free rule-set. It is well-known that in context-free grammars the derivation can be in maximal (independent) parallel way. We show that in cases of context-sensitive and recursively enumerable languages the parallel branches of the derivation have some synchronization points. In the case of context-sensitive grammars this synchronization can only be local, but in a derivation of an arbitrary grammar we cannot make this restriction. We present a framework to show how the concept of parallelism can be t to the derivations in formal language theory using tokens.
APA, Harvard, Vancouver, ISO, and other styles
8

TRUTHE, BIANCA. "REMARKS ON CONTEXT-FREE PARALLEL COMMUNICATING GRAMMAR SYSTEMS GENERATING CROSSED AGREEMENTS." International Journal of Foundations of Computer Science 19, no. 04 (2008): 873–86. http://dx.doi.org/10.1142/s0129054108006017.

Full text
Abstract:
Parallel communicating grammar systems are language generating devices consisting of several grammars which derive synchronously their sentential forms and communicate with each other by sending their sentential forms to another component on request. Due to collaboration, grammar systems with context-free components are more powerful than a single context-free grammar; they even can generate all recursively enumerable languages. In natural languages, there occur constructions that cannot be modelled by context-free languages. Three important phenomena are the so-called multiple agreements, crossed agreements and replication which are represented by the three non-context-free languages K1 = { anbncn | n ≥ 1 }, K2 = { anbmcndm | m ≥ 1, n ≥ 1 }, and K3 = { ww | w ∈ { a, b }+}, respectively. In the present paper, we give parallel communicating grammar systems (PC grammar systems) that are context-free and that generate the language K2, working in different modes. In two cases, the results are optimal.
APA, Harvard, Vancouver, ISO, and other styles
9

Gribova, V. V., A. S. Kleschev, and D. A. Krylov. "The context-free grammars of artificial languages." Automatic Documentation and Mathematical Linguistics 47, no. 2 (2013): 59–67. http://dx.doi.org/10.3103/s0005105513020052.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Mäkinen, Erkki. "On permutative grammars generating context-free languages." BIT 25, no. 4 (1985): 604–10. http://dx.doi.org/10.1007/bf01936139.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Context-free grammars and languages"

1

Wich, Klaus. "Ambiguity functions of context-free grammars and languages." [S.l.] : [s.n.], 2005. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11814259.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Teichmann, Markus. "Expressing Context-Free Tree Languages by Regular Tree Grammars." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-224756.

Full text
Abstract:
In this thesis, three methods are investigated to express context-free tree languages by regular tree grammars. The first method is a characterization. We show restrictions to context-free tree grammars such that, for each restricted context-free tree grammar, a regular tree grammar can be constructed that induces the same tree language. The other two methods are approximations. An arbitrary context-free tree language can be approximated by a regular tree grammar with a restricted pushdown storage. Furthermore, we approximate weighted context-free tree languages, induced by weighted linear nondeleting context-free tree grammars, by showing how to approximate optimal weights for weighted regular tree grammars.
APA, Harvard, Vancouver, ISO, and other styles
3

Stüber, Torsten. "Consistency of Probabilistic Context-Free Grammars." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-86943.

Full text
Abstract:
We present an algorithm for deciding whether an arbitrary proper probabilistic context-free grammar is consistent, i.e., whether the probability that a derivation terminates is one. Our procedure has time complexity $\\\\mathcal O(n^3)$ in the unit-cost model of computation. Moreover, we develop a novel characterization of consistent probabilistic context-free grammars. A simple corollary of our result is that training methods for probabilistic context-free grammars that are based on maximum-likelihood estimation always yield consistent grammars.
APA, Harvard, Vancouver, ISO, and other styles
4

Hultin, Felix. "Understanding Context-free Grammars through Data Visualization." Thesis, Stockholms universitet, Avdelningen för datorlingvistik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-130953.

Full text
Abstract:
Ever since the late 1950's, context-free grammars have played an important role within the field of linguistics, been a part of introductory courses and expanded into other fields of study. Meanwhile, data visualization in modern web development has made it possible to do feature rich visualization in the browser. In this thesis, these two developments are united, by developing a browser based app, to write context-free grammars, parse sentences and visualize the output. A user experience study with usability-tests and user-interviews is conducted, in order to investigate the possible benefits and disadvantages of said visualization when writing context-free grammars. The results show that data visualization was limitedly used by participants, in that it helped them to see if sentences were parsed and, if a sentence was not parsed, at which position parsing went wrong. Future improvements on the software and studies on them are proposed as well as the expansion of the field of data visualization within linguistics.<br>Ända sedan det sena 1950-talet har kontextfria grammatiker spelat en viktig roll hos lingvistiska teorier, används i introduktionskurser och expanderats till andra forskningsfält. Samtidigt har datavisualisering inom modern webbutveckling gjort det möjligt att skapa innehållsrik visualisering i webbläsaren. I detta examensarbete förenas dessa två utvecklingar genom utvecklandet av en webbapplikation, gjord för att skriva kontextfria grammatiker, parsa meningar och visualisera utdatan. En användarbarhetsstudie utförs, bestående av användartest och användaintervjuer, för att undersöka möjliga fördelar och nackdelar av visualisering i skrivandet av kontextfria grammatiker. Resultaten visar att data visualisering användes på ett begränsat sätt av deltagarna, i den meningen att det hjälpte dem att se om satser kan parsas och, om en sats inte blir parsad, se på vilket stället parsning misslyckades. Framtida förbättringar av applikationen och studier av dem föreslås samt en utbyggnad av data visualisering inom lingvistik.
APA, Harvard, Vancouver, ISO, and other styles
5

RAMOS, Marcus Vinícius Midena. "Formalization of context-free language theory." Universidade Federal de Pernambuco, 2016. https://repositorio.ufpe.br/handle/123456789/17642.

Full text
Abstract:
Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2016-08-08T13:11:15Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) tese.pdf: 4855618 bytes, checksum: 717d268b142705bdc8ce106731a257db (MD5)<br>Made available in DSpace on 2016-08-08T13:11:15Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) tese.pdf: 4855618 bytes, checksum: 717d268b142705bdc8ce106731a257db (MD5) Previous issue date: 2016-03-28<br>CAPEs<br>Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program development. Different such tools are being increasingly used in order to accelerate and simplify proof checking, and the Coq proof assistant is one of the most known and used. Language and automata theory is a well-established area of mathematics, relevant to computer science foundations and information technology. In particular, context-free language theory is of fundamental importance in the analysis, design and implementation of computer programming languages. This work describes a formalization effort, using the Coq proof assistant, of fundamental results of the classical theory of context-free grammars and languages. These include closure properties (union, concatenation and Kleene star), grammar simplification (elimination of useless symbols, inaccessible symbols, empty rules and unit rules), the existence of a Chomsky Normal Form for context-free grammars and the Pumping Lemma for context-free languages. To achieve this, several steps had to be fulfilled, including (i) understanding of the characteristics, importance and benefits of mathematical formalization, specially in computer science, (ii) familiarization with the underlying mathematical theories used in proof assistants, (iii) familiarization with the Coq proof assistant, (iv) review of the strategies used in the informal proofs of the main results of the context-free language theory and finally (iv) selection and adequation of the representation and proof strategies adopted in order the achieve the desired objectives. The result is an important set of libraries covering the main results of context-free language theory, with more than 500 lemmas and theorems fully proved and checked. This is probably the most comprehensive formalization of the classical context-free language theory in the Coq proof assistant done to the present date, and includes the remarkable result that is the formalization of the Pumping Lemma for context-free languages. The perspectives for the further development of this work are diverse and can be grouped in three different areas: inclusion of new devices and results, code extraction and general enhancements of its libraries.<br>Assistentes de prova são ferramentas de software que são usadas na mecanização da construção e da validação de provas na matemática e na ciência da computação, e também no desenvolvimento de programas certificados. Diferentes ferramentas estão sendo usadas de forma cada vez mais frequente para acelerar e simplificar a verificação de provas, e o assistente de provas Coq é uma das mais conhecidas e utilizadas. A teoria de linguagens e de autômatos é uma área bem estabelecida da matemática, com relevância para os fundamentos da ciência da computação e a tecnologia da informação. Em particular, a teoria das linguagens livres de contexto é de fundamental importância na análise, no projeto e na implementação de linguagens de programação de computadores. Este trabalho descreve um esforço de formalização, usando o assistente de provas Coq, de resultados fundamentais da teoria clássica das gramáticas e linguagens livres de contexto. Estes incluem propriedades de fechamento (união, concatenação e estrela de Kleene), simplificação gramatical (eliminação de símbolos inúteis, de símbolos inacessíveis, de regras vazias e de regras unitárias), a existência da Forma Normal de Chomsky para gramáticas livres de contexto e o Lema do Bombeamento para linguagens livres de contexto. Para alcançar estes resultados, diversas etapas precisaram ser cumpridas, incluindo (i) o entendimento das características, da importância e dos benefícios da formalização matemática, especialmente na ciência da computação, (ii) a familiarização com as teorias matemáticas fundamentais utilizadas pelos assistentes de provas, (iii) a familiarização com o assistente de provas Coq, (iv) a revisão das estratégias usadas nas provas informais dos principais resultados da teoria das linguagens livres de contexto e, finalmente, (v) a seleção e adequação das estratégias de representação e prova adotadas para permitir o alcance dos resultados pretendidos. O resultado é um importante conjunto de bibliotecas cobrindo os principais resultados da teoria das linguagens livres de contexto, com mais de 500 lemas e teoremas totalmente provados e verificados. Esta é provavelmente a formalização mais abrangente da teoria clássica das linguagens livres de contexto jamais feita no assistente de provas Coq, e inclui o importante resultado que é a formalização do Lema do Bombeamento para linguagens livres de contexto. As perspectivas para novos desenvolvimentos a partir deste trabalho são diversas e podem ser agrupadas em três áreas diferentes: inclusão de novos dispositivos e resultados, extração de código e aprimoramentos gerais das suas bibliotecas.
APA, Harvard, Vancouver, ISO, and other styles
6

Lee, Wing Kuen. "Interpreting tables in text using probabilistic two-dimensional context-free grammars /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20LEEW.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Teichmann, Markus [Verfasser], Heiko [Akademischer Betreuer] [Gutachter] Vogler, and Frank [Gutachter] Drewes. "Expressing Context-Free Tree Languages by Regular Tree Grammars / Markus Teichmann ; Gutachter: Heiko Vogler, Frank Drewes ; Betreuer: Heiko Vogler." Dresden : Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://d-nb.info/1133109616/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vít, Radek. "Grammar-Based Translation Framework." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403120.

Full text
Abstract:
V této práci prozkoumáváme existující algoritmy pro přijímání jazyků definovaných bezkontextovými gramatikami. Na základě těchto znalostí navrhujeme nový model pro reprezentaci LR automatů a s jeho pomocí definujeme nový algoritmus LSCELR. Modifikujeme algoritmy pro přijímání jazyků k vytvoření algoritmů pro překlad založený na překladových gramatikách. Definujeme atributové překladové gramatiky jako rozšířené překladové gramatiky pro definici vztahů mezi vstupními a výstupními symboly překladu. Implementujeme překladový framework ctf založený na gramatikách, který implementuje překlad pomocí LSCELR. Definujeme jazyk pro popis atributových překladových gramatik a implementujeme překladač pro překlad této reprezentace do zdrojového kódu pro implementovaný framework.
APA, Harvard, Vancouver, ISO, and other styles
9

He, Jun. "Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search." Doctoral thesis, Uppsala universitet, Avdelningen för datalogi, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-196347.

Full text
Abstract:
This thesis focuses on constraints for membership in formal languages under both the systematic search and stochastic local search approaches to constraint programming (CP). Such constraints are very useful in CP for the following three reasons: They provide a powerful tool for user-level extensibility of CP languages. They are very useful for modelling complex work shift regulation constraints, which exist in many shift scheduling problems. In the analysis, testing, and verification of string-manipulating programs, string constraints often arise. We show in this thesis that CP solvers with constraints for membership in formal languages are much more suitable than existing solvers used in tools that have to solve string constraints. In the stochastic local search approach to CP, we make the following two contributions: We introduce a stochastic method of maintaining violations for the regular constraint and extend our method to the automaton constraint with counters. To improve the usage of constraints for which there exists no known constant-time algorithm for neighbour evaluation, we introduce a framework of using solution neighbourhoods, and give an efficient algorithm of constructing a solution neighbourhood for the regular constraint. In the systematic search approach to CP, we make the following two contributions: We show that there may be unwanted consequences when using a propagator that may underestimate a cost of a soft constraint, as the propagator may guide the search to incorrect (non-optimum) solutions to an over-constrained problem. We introduce and compare several propagators that compute correctly the cost of the edit-distance based soft-regular constraint. We show that the context-free grammar constraint is useful and introduce an improved propagator for it.
APA, Harvard, Vancouver, ISO, and other styles
10

Backhouse, Kevin Stuart. "Abstract interpretation of domain-specific embedded languages." Thesis, University of Oxford, 2002. http://ora.ox.ac.uk/objects/uuid:9138936a-145a-4e0e-9a59-f432f8c4e9d0.

Full text
Abstract:
A domain-specific embedded language (DSEL) is a domain-specific programming language with no concrete syntax of its own. Defined as a set of combinators encapsulated in a module, it borrows the syntax and tools (such as type-checkers and compilers) of its host language; hence it is economical to design, introduce, and maintain. Unfortunately, this economy is counterbalanced by a lack of room for growth. DSELs cannot match sophisticated domain-specific languages that offer tools for domainspecific error-checking and optimisation. These tools are usually based on syntactic analyses, so they do not work on DSELs. Abstract interpretation is a technique ideally suited to the analysis of DSELs, due to its semantic, rather than syntactic, approach. It is based upon the observation that analysing a program is equivalent to evaluating it over an abstract semantic domain. The mathematical properties of the abstract domain are such that evaluation reduces to solving a mutually recursive set of equations. This dissertation shows how abstract interpretation can be applied to a DSEL by replacing it with an abstract implementation of the same interface; evaluating a program with the abstract implementation yields an analysis result, rather than an executable. The abstract interpretation of DSELs provides a foundation upon which to build sophisticated error-checking and optimisation tools. This is illustrated with three examples: an alphabet analyser for CSP, an ambiguity test for parser combinators, and a definedness test for attribute grammars. Of these, the ambiguity test for parser combinators is probably the most important example, due to the prominence of parser combinators and their rather conspicuous lack of support for the well-known LL(k) test. In this dissertation, DSELs and their signatures are encoded using the polymorphic lambda calculus. This allows the correctness of the abstract interpretation of DSELs to be proved using the parametricity theorem: safety is derived for free from the polymorphic type of a program. Crucially, parametricity also solves a problem commonly encountered by other analysis methods: it ensures the correctness of the approach in the presence of higher-order functions.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Context-free grammars and languages"

1

Meduna, Alexander. Grammars with context conditions and their applications. Wiley-Interscience, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Martin, Svec, ed. Grammars with context conditions and their applications. John Wiley & Sons, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kallmeyer, Laura. Parsing Beyond Context-Free Grammars. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14846-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Berry, Matthew. Grammar in context. Oxford University Press, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Barton, Geoff. Grammar in context. Oxford University Press, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

English grammar in context. Allyn and Bacon, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Teaching grammar in context. Boynton/Cook Publishers, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

J, Miller Frank, Kudyma Ganna, and Kagan Olga, eds. Russian grammar in context. 2nd ed. Pearson Prentice Hall, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gauker, Christopher. Conditionals in context. MIT Press, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Conditionals in context. MIT Press, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Context-free grammars and languages"

1

Engelfriet, Joost. "Context-Free Graph Grammars." In Handbook of Formal Languages. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59126-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kozen, Dexter C. "Context-Free Grammars and Languages." In Automata and Computability. Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1844-9_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jürgensen, Helmut, and Kai Salomaa. "Block-Synchronization Context-Free Grammars." In Advances in Algorithms, Languages, and Complexity. Springer US, 1997. http://dx.doi.org/10.1007/978-1-4613-3394-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Minamide, Yasuhiko, and Akihiko Tozawa. "XML Validation for Context-Free Grammars." In Programming Languages and Systems. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11924661_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bertoni, Alberto, Christian Choffrut, and Beatrice Palano. "Context-Free Grammars and XML Languages." In Developments in Language Theory. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11779148_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Schmitz, Sylvain. "Conservative Ambiguity Detection in Context-Free Grammars." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73420-8_60.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Christiansen, Henning. "Adaptable Grammars for Non-Context-Free Languages." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02478-8_61.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Partee, Barbara H., Alice Ter Meulen, and Robert E. Wall. "Pushdown Automata, Context Free Grammars and Languages." In Studies in Linguistics and Philosophy. Springer Netherlands, 1993. http://dx.doi.org/10.1007/978-94-009-2213-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hoogeboom, Hendrik Jan. "Context-Free Valence Grammars - Revisited." In Developments in Language Theory. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46011-x_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ésik, Zoltán, and Szabolcs Iván. "On Müller Context-Free Grammars." In Developments in Language Theory. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14455-4_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Context-free grammars and languages"

1

Firsov, Denis, and Tarmo Uustalu. "Certified Normalization of Context-Free Grammars." In POPL '15: The 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, 2015. http://dx.doi.org/10.1145/2676724.2693177.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Javed, Faizan. "Inferring context-free grammars for domain-specific languages." In Companion to the 20th annual ACM SIGPLAN conference. ACM Press, 2005. http://dx.doi.org/10.1145/1094855.1094940.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Javed, Faizan. "Inferring context-free grammars for domain-specific languages." In Companion to the 20th annual ACM SIGPLAN conference. ACM Press, 2005. http://dx.doi.org/10.1145/1094855.1094955.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Verano Merino, Mauricio, and Tijs van der Storm. "Block-based syntax from context-free grammars." In SPLASH '20: Conference on Systems, Programming, Languages, and Applications, Software for Humanity. ACM, 2020. http://dx.doi.org/10.1145/3426425.3426948.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

PAPASPYROU, NIKOLAOS S., and VASSILIOS C. VESCOUKIS. "FACILITATING THE DEFINITION OF PROGRAMMING LANGUAGES BY USING PARAMETRIC CONTEXT-FREE GRAMMARS." In Proceedings of the 7th Hellenic Conference on Informatics (HCI '99). WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812793928_0023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dordevic, Teodora, and Suzana Stojkovic. "Syntax Analysis of Serbian Language using Context-free Grammars." In 2020 55th International Scientific Conference on Information, Communication and Energy Systems and Technologies (ICEST). IEEE, 2020. http://dx.doi.org/10.1109/icest49890.2020.9232872.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rossouw, Christoff, and Bernd Fischer. "Test case generation from context-free grammars using generalized traversal of LR-automata." In SPLASH '20: Conference on Systems, Programming, Languages, and Applications, Software for Humanity. ACM, 2020. http://dx.doi.org/10.1145/3426425.3426938.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Clark, Alexander. "Canonical Context-Free Grammars and Strong Learning: Two Approaches." In Proceedings of the 14th Meeting on the Mathematics of Language (MoL 2015). Association for Computational Linguistics, 2015. http://dx.doi.org/10.3115/v1/w15-2309.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Meteer, M., and J. R. Rohlicek. "Statistical language modeling combining N-gram and context-free grammars." In Proceedings of ICASSP '93. IEEE, 1993. http://dx.doi.org/10.1109/icassp.1993.319223.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Manaster-Ramer, Alexis. "Copying in natural languages, context-freeness, and Queue Grammars." In the 24th annual meeting. Association for Computational Linguistics, 1986. http://dx.doi.org/10.3115/981131.981145.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Context-free grammars and languages"

1

Heeringa, Brent, and Tim Oates. Two Algorithms for Learning the Parameters of Stochastic Context-Free Grammars. Defense Technical Information Center, 2001. http://dx.doi.org/10.21236/ada459920.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Obua, Steven. A New Semantics for Local Lexing. Recursive Mind, 2021. http://dx.doi.org/10.47757/obua.ll.1.

Full text
Abstract:
A revised semantics for Local Lexing is presented that entirely avoids priority conflicts between non-empty tokens. Pyramid Grammars are introduced, and their semantics is given in terms of Local Lexing. It is demonstrated that they are more expressive than context-free grammars, and at least as expressive as Parsing Expression Grammars.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography