Question

Build a LR parsing table for the following grammar:

F → f

Answer 1

parse table is defined as the table format which is extracted from a grammar by using a parser generator.
the LR parsing table also derived from a grammar using the parser generator.

now the LR parse table is defined as the table version which is used to parser a large number of grammars. in the LR parsing table, L derived as scanning the input from left to right whereas the R derived as the process of constructing rightmost derivation in reverse.

now this LR parse table consists of rows and columns where the rows define the states
and columns define the terminals and non-terminals

here the terminal will work as the shift and reduce actions whereas the non-terminal acts as the for and goto actions.

now the below steps explains the construction of the LR parse table for F → f

if F is terminal, put shift f at (F, f)
if F is non-terminal, then put goto f at (F, f)
if f contains s' → s then put accept at (f, s)
if f contains A → α then put reduce at (f, α)