DocumentCode
1108257
Title
Generation of Right-Linear Grammars from Regular Expressions
Author
Patel, Ankeeta R.
Issue
4
fYear
1971
fDate
4/1/1971 12:00:00 AM
Firstpage
472
Lastpage
473
Abstract
A finite state language can be represented by a regular expression or a right-linear grammar. An algorithm to generate a right-linear grammar for regular expression is presented. The algorithm can be implemented on computers. A Snobol 4 program for this algorithm was written for the IBM 360/65 with success.
Keywords
Finite automata, finite state languages, regular expressions, right-linear grammar.; Convergence; Distributed computing; Iterative algorithms; Mathematics; Random variables; Finite automata, finite state languages, regular expressions, right-linear grammar.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1971.223271
Filename
1671864
Link To Document