• Keine Ergebnisse gefunden

Reguläre Grammatiken

N/A
N/A
Protected

Academic year: 2022

Aktie "Reguläre Grammatiken"

Copied!
10
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Linear Grammars

Grammars with

at most one variable at the right side of a production

Examples:

A

aAb A

Ab S

S

aSb

S

(2)

A Non-Linear Grammar

bSa S

aSb S

S

SS S

Grammar :

G

)}

( )

( :

{ )

( G w n w n w

L

a

b

(3)

Another Linear Grammar

Grammar :

Ab B

aB A

A S

|

} 0 :

{ )

( Ga b n

L

n n

G

(4)

Right-Linear Grammars

All productions have form:

Example:

xB A

x A

or

a S

abS S

string of

terminals

(5)

Left-Linear Grammars

All productions have form:

Example:

Bx A

a B

B Aab

A

Aab S

|

x A

or

string of terminals

(6)

Regular Grammars

(7)

Regular Grammars

A regular grammar is any

right-linear or left-linear grammar Examples:

a S

abS S

a B

B Aab

A

Aab S

|

G

1

G

2

(8)

Observation

Regular grammars generate regular languages Examples:

a S

abS S

a B

B Aab

A

Aab S

| G

1

G

2

(9)

Regular Grammars Generate

Regular Languages

(10)

Theorem

Languages

Generated by

Regular Grammars

Regular

Languages

Referenzen

ÄHNLICHE DOKUMENTE

Gabriele R¨ oger (University of Basel) Theory of Computer Science March 15, 2021 5 / 29?. Repetition:

GNFAs are like NFAs but the transition labels can be arbitrary regular expressions over the input alphabet. q 0

GNFAs are like NFAs but the transition labels can be arbitrary regular expressions over the input alphabet. q 0

I DFAs, NFAs and regular grammars can all describe exactly the regular languages.. I Are there other concepts with the

ations, open clusters and young Seid stars- This distribution is compared with the distribution of neutral (K I+ H 2 ) hydrogen. Ail available observational data on

Step 3: Superposition of the input and output structures ⇒ Program structure. ADR

Ausserdem werden in dieser Arbeit der altbekannte Satz von Napoleon und der Satz von den Transversalen, die beide f¨ur Dreiecke gelten, mit ¨ahnlichen Methoden auf affine

4 Generating all the regular Diophantine quadruples emanating from 1 In order to generate all regular Diophantine quadruples emanating from 1, i.e., { 1, b , c , d} , where 1 <