𝑃𝑎𝑟𝑎 𝑒𝑙 𝑡𝑟𝑎𝑏𝑎𝑗𝑜 𝑑𝑒 𝑙𝑎 𝑠𝑒𝑚𝑎𝑛𝑎 10

𝐼) 𝐸𝑙 𝑝𝑟𝑜𝑔𝑟𝑎𝑚𝑎 𝑑𝑒𝑏𝑒 𝑝𝑒𝑑𝑖𝑟 𝑙𝑎𝑠 𝑝𝑟𝑜𝑑𝑢𝑐𝑐𝑖𝑜𝑛𝑒𝑠 𝐿𝐿(1)

1) 𝑆 → 𝑎𝑆 2) 𝑆 → 𝐵𝐶 3) 𝐵 → 𝑏𝑆 4) 𝐵 → 𝑑𝐴
5) 𝐴 → 𝑎 6) 𝐴 → 𝑏 7) 𝐶 → 𝑐 8) 𝐶 → 𝑒

𝐸𝑛𝑡𝑜𝑛𝑐𝑒𝑠 𝑒𝑙 𝑝𝑟𝑜𝑔𝑟𝑎𝑚𝑎 𝑚𝑢𝑒𝑠𝑡𝑟𝑎:

I. 1 𝐸𝑙 𝑐𝑜𝑛𝑗𝑢𝑛𝑡𝑜 𝑃𝑟𝑖𝑚𝑒𝑟𝑜 𝑑𝑒 𝑐𝑎𝑑𝑎 𝑛𝑜 𝑡𝑒𝑟𝑚𝑖𝑛𝑎𝑙

𝑃𝑟𝑖𝑚𝑒𝑟𝑜 𝐴 = 𝑎, 𝑏
𝑃𝑟𝑖𝑚𝑒𝑟𝑜 𝐵 = 𝑏, 𝑑
𝑃𝑟𝑖𝑚𝑒𝑟𝑜 𝐶 = 𝑐, 𝑒
𝑃𝑟𝑖𝑚𝑒𝑟𝑜 𝑆 = 𝑎, 𝑏, 𝑑
I. 2 𝐸𝑙 𝑝𝑟𝑜𝑔𝑟𝑎𝑚𝑎 𝑚𝑢𝑒𝑠𝑡𝑟𝑎 𝑙𝑎 𝑇𝑎𝑏𝑙𝑎 𝑑𝑒 𝑙𝑎 𝐹𝑢𝑛𝑐𝑖ó𝑛 𝐴𝑐𝑐𝑖ó𝑛

a b c d e #
S (𝑆 → 𝑎𝑆,1) (𝑆 → 𝐵𝐶,2) ∅ (𝑆 → 𝐵𝐶,2) ∅ ∅
A (𝐴 → 𝑎,5) (𝐴 → 𝑏,6) ∅ ∅ ∅ ∅
B ∅ (𝐵 → 𝑏𝑆,3) ∅ (𝐵 → 𝑑𝐴, 4) ∅ ∅
C ∅ ∅ (𝐶 → 𝑐,7) ∅ (𝐶 → 𝑒,8) ∅
a 𝐸_𝐶 ∅ ∅ ∅ ∅ ∅
b ∅ 𝐸_𝐶 ∅ ∅ ∅ ∅
c ∅ ∅ 𝐸_𝐶 ∅ ∅ ∅
d ∅ ∅ ∅ 𝐸_𝐶 ∅ ∅
e ∅ ∅ ∅ ∅ 𝐸_𝐶 ∅
# ∅ ∅ ∅ ∅ ∅ 𝐴𝐶𝐸𝑃𝑇𝐴𝑅
𝐼𝐼) 𝐸𝑙 𝑝𝑟𝑜𝑔𝑟𝑎𝑚𝑎 𝑝𝑖𝑑𝑒 𝑢𝑛𝑎 𝑐𝑎𝑑𝑒𝑛𝑎 𝑎 𝑟𝑒𝑐𝑜𝑛𝑜𝑐𝑒𝑟 𝑦 𝑟𝑒𝑎𝑙𝑖𝑧𝑎 𝑒𝑙 𝑟𝑎𝑠𝑡𝑟𝑒𝑜 𝑟𝑒𝑠𝑝𝑒𝑐𝑡𝑖𝑣𝑜

𝐸𝑗𝑒𝑚𝑝𝑙𝑜
𝑅𝑎𝑠𝑡𝑟𝑒𝑜 𝑝𝑎𝑟𝑎 𝑙𝑎 𝑐𝑎𝑑𝑒𝑛𝑎: 𝑎𝑏𝑑𝑎𝑐𝑒
 𝑅𝑎𝑡𝑟𝑒𝑜 𝑝𝑎𝑟𝑎 𝑙𝑎 𝑐𝑎𝑑𝑒𝑛𝑎: 𝑎𝑏𝑑𝑎𝑐𝑒
La cadena a reconocer La Pila Producciones usadas

abdace# S# λ 𝐿𝑎 𝑐𝑎𝑑𝑒𝑛𝑎 𝑎𝑏𝑑𝑎𝑐𝑒

abdace# aS# 𝑆 → 𝑎𝑆
𝑝𝑒𝑟𝑡𝑒𝑛𝑒𝑐𝑒 𝑎𝑙 𝑙𝑒𝑛𝑔𝑢𝑎𝑗𝑒
bdace# S# E_C
bdace# BC# 𝑆 → 𝐵𝐶 𝑑𝑒 𝑙𝑎 𝑔𝑟𝑎𝑚á𝑡𝑖𝑐𝑎
bdace# bSC# 𝐵 → 𝑏𝑆
dace# SC# E_C
dace# BCC# 𝑆 → 𝐵𝐶
dace# dACC# 𝐵 → 𝑑𝐴
ace# ACC# E_C
ace# aCC# 𝐴→𝑎
ce# CC# 𝐸_𝐶
ce# cC# 𝐶→𝑐
e# C# E_C
e# e# 𝐶→𝑒
# # E_C -> ACEPTAR