Generation of Right-Linear Grammars from Regular Expressions

Authors:
A. R. Patel
Affiliations:
Comput. Ctr. Univ. Conn.
Venue:
IEEE Transactions on Computers
Year:
1971

Citing 2
Cited 0

Derivatives of Regular Expressions

Journal of the ACM (JACM)
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Quantified Score

Hi-index	14.98

Visualization

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.