Skip to search formSkip to main contentSkip to account menu

Prefix grammar

In theoretical computer science and formal language theory, a prefix grammar is a type of string rewriting system, consisting of a set of string… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Formal grammarIndex of computing articlesRegular expressionRegular grammar

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The ordinal generated by an ordinal grammar is computable
2014
2014
Turchin's Relation and Subsequence Relation in Loop Approximation
  • A. Nepeivoda
  • Ershov Memorial Conference
  • 2014
  • Corpus ID: 15241281
The paper studies the subsequence relation through a notion of an intransitive binary relation on words in traces generated by… 
2011
2011
An undecidable property of context-free linear orders
2011
2011
Context-free ordinals
We consider context-free languages equipped with the lexicographic ordering. We show that when the lexicographic ordering of a… 
2010
2010
An undecidable property of context-free languages
We prove that there exists no algorithm to decide whether the language generated by a context-free grammar is dense with respect… 
1986
1986
Up-down parsing with prefix grammars
A powerful method of parsing is presented, that suits particularly well the Graham-Glanville code generation methodology. This… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)