Representation of regular formal languages.
This dissertation presents three different approaches to representing Regular Formal languages, i.e., regular expressions, finite acceptors and regular grammars. We define how each method is used to represent the language, and then the method for translating from one representation to another of the...
Main Author: | Safla, Aslam. |
---|---|
Other Authors: | Velinov, Yuri. |
Language: | en_ZA |
Published: |
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10413/10712 |
Similar Items
-
Extensible language implementation
by: Kolbly, Donovan Michael
Published: (2008) -
Semantic Database Model Language (SDML): grammar specification and parser
by: Lane, Richard Vernon.
Published: (2015) -
Design of a generic parse tree for imperative languages
by: Mansfield, Martin F.
Published: (2011) -
Practical Earley parsing and the SPARK toolkit
by: Aycock, John Daniel
Published: (2018) -
Formal semantics and the logical structure of programming languages
by: DeMillo, Richard Alan
Published: (2006)