About: Recursive grammar     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatFormalLanguages, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FRecursive_grammar&invfp=IFP_OFF&sas=SAME_AS_OFF

In computer science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a non-terminal according to these rules can eventually lead to a string that includes the same non-terminal again. Otherwise it is called a non-recursive grammar.

AttributesValues
rdf:type
rdfs:label
  • Gramàtica recursiva (ca)
  • Recursive grammar (en)
rdfs:comment
  • En lingüística i informàtica, una gramàtica es diu informalment que és una gramàtica recursiva si conté regles de producció que son recursives, és a dir, que expandint un símbol no-terminal seguint una regla pot portar a una cadena que conté el mateix símbol no terminal. Si no els conté, se'n diu una gramàtica no recursiva. (ca)
  • In computer science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a non-terminal according to these rules can eventually lead to a string that includes the same non-terminal again. Otherwise it is called a non-recursive grammar. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • En lingüística i informàtica, una gramàtica es diu informalment que és una gramàtica recursiva si conté regles de producció que son recursives, és a dir, que expandint un símbol no-terminal seguint una regla pot portar a una cadena que conté el mateix símbol no terminal. Si no els conté, se'n diu una gramàtica no recursiva. Per exemple, una gramàtica lliure de context és recursiva per l'esquerra si existeix un símbol no-terminal A tal que alguna de les regles de producció permet que es generi una cadena amb el símbol A (com a símbol més a l'esquerra). Totes les gramàtiques de la jerarquia de Chomsky poden ser recursives i és la recursivitat el que permet la producció de conjunts infinits de paraules. (ca)
  • In computer science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a non-terminal according to these rules can eventually lead to a string that includes the same non-terminal again. Otherwise it is called a non-recursive grammar. For example, a grammar for a context-free language is left recursive if there exists a non-terminal symbol A that can be put through the production rules to produce a string with A (as the leftmost symbol).All types of grammars in the Chomsky hierarchy can be recursive and it is recursion that allows the production of infinite sets of words. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software