20.1.1. RP 1 part 1¶

Topics of the day:

1. Syntax versus semantics
2. Terminology of grammars
3. Derivations and parse trees
4. Lexical structure versus phrase structure

1 / 40 Settings

<<<>>>

λ expression is always the non-terminal ε.

1. A
2. +
3. B
4. *
5. C
6. +
7. (
8. E
9. *
10. F
11. +
12. G
13. )

The root node of the parse tree for any

<Exp>

<Fac>

<Pri>

A

<Mul>

ε

<Add>

+

<Fac>

<Pri>

B

<Mul>

*

<Pri>

C

<Mul>

ε

<Add>

+

<Fac>

<Pri>

(

<Exp>

<Fac>

<Pri>

E

<Mul>

*

<Pri>

F

<Mul>

ε

<Add>

+

<Fac>

<Pri>

G

<Mul>

ε

<Add>

ε

)

<Mul>

ε

<Add>

ε

Saving...
Server Error
Resubmit

The review problem set for today contains four review problems.

This problem is about building a parse tree given a grammar and a string.

20.1.2. RP 1 part 2¶

This problem is about determining whether a given string can be generated by a given grammar.

20.1.3. RP 1 part 3¶

This problem is about identifying properties of all of the strings in a language defined by a given grammar.

20.1.4. RP 1 part 4¶

This problem is about precisely characterizing the whole language generated by a given grammar.