Raport: La lucrarea de laborator Nr. 1

Universitatea Tehnică a Moldovei Facultatea Calculatoare Informatică și Microelectronică

RAPORT La lucrarea de laborator Nr. 1. La disciplina: “LimbajeFormale și Automate”

TEMA: „ Gramatici regulate ”

Elaborat: st.gr.TIVerificat: lect. sup. Duca Ludmila

Chișinău 2017

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

De construit o gramatică care constă din :

 = 5  = 3 Mulțimea de producție  . P = 20

 = {    } }  = {ℎ   } R –  simbol  simbol initial

Mulțimea de Producție

 = { )  ) →  )  →  } 1. R → ℎ

6. T→ ℎ

11. P→ 

16. Y→ 

2. R → 

7. T→ 

12. P → ℎ

17. L→ ℎ

 3. R →  = 

8. T→ ℎ

13. Y→ ℎ

18.L→ 

4. R → ℎ

9. P→ ℎ

14. Y→ ℎ

19.L→ 

5. T→ 

10. P→ 

15. Y→ 

20. L→ 

De construit 5 cuvinte, lungimea cărora trebuie să fie + ,  =  1

8

19

1

9



10

ℎ → ℎℎℎ ℎℎℎ  → ℎℎℎ ℎℎℎℎ ℎ → ℎℎℎ ℎℎℎℎ ℎ  → ℎℎℎ ℎℎℎℎ ℎ R → ℎ → ℎℎ → ℎℎ ↑

↑

↑

↑

↑

↑

Pentru fiecare cuvînt de construit arborele de derivare

→→→→→→ ↑

↑

↑

↑

↑

↑

↑

h

h

m

h

h

m

n

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

 - simbol de tranziție  - mulțimea funcției de tranziție F- mulțimea stărilor finale

0 - starea inițială X- starea finală Q=  

0 =  Q=  = {, , , , } F={X}

 =   ă    ( ℎ) ℎ) = 

 ( ) ) = 

 ( ) ) = 

 ( ) ) = 

 ( ) ) = 

 ( ) ) = 

 ( ℎ) ℎ) = 

 ( ℎ) ℎ) = 

 ( ) ) = 

 ( ℎ) ℎ) = 

 ( ℎ) ℎ) = 

 ( ) ) = 

 ( ℎ) ℎ) = 

 ( ℎ) ℎ) = 

 ( ℎ) ℎ) = 

 ( ) ) = 

 ( ) ) = 

 ( ) ) = 

 ( ) ) = 

 ( ) ) = 

Metoda grafului de reprezentare:

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Metoda Tabel:



14

17



h

n

m

R

XT

Y

P

T

YL

T

P

Y

PL

R

X

P

RL

X

Y

L

R

TP

m

X

-

-

-

11

1

10

2)R  2)R →  → ℎ → ℎℎ ℎℎ → ℎℎ ℎℎ  → ℎℎ ℎℎ  → ℎℎ ℎℎℎ ℎ  → ℎℎ ℎℎℎ ℎ 

↑

↑

↑

↑

↑

↑

→→→→→→



9

1

↓

↓

↓

↓

↓

n

h

h

m

m

8

18

↓ h

↓ n

8

0

3) R →  → ℎ → ℎℎ ℎℎ → ℎℎℎ ℎℎℎ  → ℎℎℎ ℎℎℎ  → ℎℎℎ ℎℎℎℎ ℎ  → ℎℎℎ ℎℎℎℎ ℎ 

↑

↑

↑

↑

↑

↑

→→→→→→



1

1

↓

↓

m

h

19

↓ h

↓

↓

h

1

n

↓ h

↓ n



10

ℎℎ → ℎℎ ℎℎ  → ℎℎ ℎℎ  → ℎℎ ℎℎ   → ℎℎ ℎℎ   4) R →  → ℎ → ℎℎ ↑

↑

↑

↑

↑

↑

→→→→→→ ↓

↓

↓

n

h

h

↓

↓

↓

↓

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

→→→→→→ ↓

↓

↓

↓

↓

m

h

h

n

m

↓ h

↓ h

Tipul de gramatică 0  : (gramatică fără restricții)

Tipul de gramatică 1: (gramatică senzitivă de context) Regula: α1Aα2

→

α1βα2 , AV N , β (V N  VT)+ , α1, α2 (V N  VT)*

Tipul de gramatică 2: (gramatică independentă de context) Regula: A Regula: A

→

β , AV N , β (V N  VT)*

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Cuvîntul 1 –  hhmhhmn  hhmhhmn

Cuvîntul 2 –  nhhmmhn  nhhmmhn

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Cuvîntul 3 - mhhhnhn

Cuvîntul 4 –  nhhmnm  nhhmnm

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Trusted by over 1 million members

Try Scribd FREE for 30 days to access over 125 million titles without ads or interruptions! Start Free Trial Cancel Anytime.

Cuvîntul 5 –  mhhnmhh  mhhnmhh

Concluzie : în urma realizării lucrării de laborator am căpătat deprindere de lucru cu Automate

finite, am studiat tipurile de gramatică (0, 1, 2, 3) astfel cu ajutorul gramaticii de tipul 3 am construit 5 cuvinte, lungimea cărora nu era mai mica de   2, primul cuvînt (hhmhhn) am re prezentat prin metoda analitică, metoda grafică, metoda tabel si am construit arborele de derivare . Cu ajutorul programului JFLAP am

introdus gramatica pentru fiecare tip , am verificat fiacare cuvînt, acestea fiind acceptate și astfel au fost construite arborele de derivare automat.