Parsing algorithms for grammars with regulated rewriting
In recent papers [4, 5, 8, 11] Petri net controlled grammars have been introduced and investigated. It was shown that various regulated grammars such as random context, matrix, vector, valence grammars, etc., resulted from enriching context-free grammars with additional mechanisms can be unified int...
Main Authors: | Turaev, Sherzod, Othman, Mohamed, Selamat, Mohd Hasan, Krassovitskiy, Alexander |
---|---|
Format: | Conference or Workshop Item |
Language: | English English |
Published: |
2011
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/27325/ http://irep.iium.edu.my/27325/ http://irep.iium.edu.my/27325/1/Parsing_Algorithms_for_Grammars_with_Regulated_Rewriting.pdf http://irep.iium.edu.my/27325/4/ACRE.pdf |
Similar Items
-
Watson–Crick context-free grammars: Grammar simplifications and a parsing algorithm
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2018) -
Grammars controlled by Petri Nets
by: Dassow, Juergen, et al.
Published: (2012) -
Language classes generated by tree controlled grammars with bounded nonterminal complexity
by: Turaev, Sherzod, et al.
Published: (2012) -
Tree valence controlled grammars
by: Ashaari, Salbiah, et al.
Published: (2017) -
Context-free petri net controlled grammars under parallel firing strategy
by: Mavlankulov, Gairatzhan, et al.
Published: (2016)