És gay e gostas de meninos pequeninos

R -> RbX | XQZ | c
X -> Xa | bRd
Q -> a
Z -> b|c

step 1: mutual recursion

nothing to do here, move along...

step 2: factorization

nothing to do here, move along...

step 3: left recursion

R -> XQZR' | cR'
R' -> bXR' | e
X -> bRdX'
X' -> aX' | e
Q -> a
Z -> b|c

step 4: left corners

R -> bRdX'QZR' | cR'
R' -> bXR' | e
X -> bRdX'
X' -> aX' | e
Q -> a
Z -> b | c

2.

first(R) = b, c
first(R') = b, e
first(X) = b
first(X') = a, e
first(Q) = a
first(Z) = b, c

follow(R) = d, $
follow(R') = follow(R) = d, $
follow(X) = first(R') U follow(R') = b, d, $
follow(X') = first(Q) U follow(X) = a, b, d, $
follow(Q) = first(Z) = b, c
follow(Z) = first(R') U follow(R) = b, d, $

3.

		a			b			c			d			$
R					bRdX'QZR'		cR'
R'					bXR						epsilon			epsilon
X					bRdX
X'		aX'/epsilon		epsilon						epsilon			epsilon
Q		a
Z					b			c

stack			input			action
R$			bcdac$			bRdX'QZR'
bRdX'QZR'$		bcdac$			b
RdX'QZR'$		cdac$			cR'
cR'dX'QZR'$		cdac$			c
R'dX'QZR'$		dac$			eps
dX'QZR'$		dac$			d
X'QZR'$			ac$			aX'
aX'QZR'$		ac$			a
X'QZR'$			c$			backtrack
X'QZR'$			ac$			eps
QZR'$			ac$			a
aZR'$			ac$			a
ZR'$			c$			c
cR'$			c$			c
R'$			$			eps
$			$			accept