Tutorial 3
Bạn đang xem bản rút gọn của tài liệu. Xem và tải ngay bản đầy đủ của tài liệu tại đây (10.28 KB, 1 trang )
TUTORIAL 3
1. Consider the following grammar
E à T+E | T
T à id
a. Construct the collection of sets of LR(0) items for this grammar
b. Construct the parsing table using SLR method
c. Show the moves according to the table constructed above on the inputs of id+id and
id+id+id
2. Show that the following grammar is LL(1) but not SLR(1). Also, show that the
grammar is LR(1) as well.
S à AaAb | BbBa
Aà∈
Bà∈
Hint: Note that S à •∈ is concurrently equivalent to S à ∈•, or we can write S à •
3. Show that the following grammar is LR(1) but not SLR(1)
S à Aa | bAc | dc | bda
Aàd
4. Show that the following grammar is LR(1) but not LALR(1)
S à As | bAc | Bc | bBa
Aàd
Bàd
PDF created with pdfFactory Pro trial version www.pdffactory.com
