Incremental Learning of Context Free Grammars by Parsing-Based Rule Generation and Rule Set Search

2006 ◽  
Vol 21 ◽  
pp. 371-379 ◽  
Author(s):  
Katsuhiko Nakamura ◽  
Akemi Hoshina
Keyword(s):  
Incremental Learning ◽  
Rule Generation ◽  
Rule Set ◽  
Context Free ◽  
Context Free Grammars

scholarly journals Derivation "Trees" and Parallelism in Chomsky-Type Grammars

Triangle ◽  
2018 ◽  
pp. 101
Author(s):  
Benedek Nagy
Keyword(s):  
Formal Language ◽  
Phrase Structure ◽  
Formal Language Theory ◽  
Language Theory ◽  
Context Sensitive ◽  
Recursively Enumerable ◽  
Rule Set ◽  
Context Free ◽  
Recursively Enumerable Languages ◽  
Context Free Grammars

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.

Sign in / Sign up

Export Citation Format

Share Document