Model Examen LFA


1. Definiti: FIRST, FOLLOW, gramatica LL(k) .
2. Descrieti algoritmul de analiza sintactica (parsare) LL(1)
3. Fie gramatica: A->B*A, A->b, B->(A), B->a
Construiti tabela de parsare LL(1) si verificati daca gramatica e LL(1).
4. Fie gramatica: S->BA, A->Bb | B , B->a . Construiti automatul LR(0) si tabela de parsare SLR(1). Realizati parsarea cuvintelor abb si abbbab.

Multumim lui Lucian Paslariu.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: