Question

what is need to construct LALR parser?​

Answer 1

$\huge\color{cyan}\boxed{\colorbox{black}{ANSWER}}$

• ꜰᴏʀ ᴛʜᴇ ɢɪᴠᴇɴ ɪɴᴘᴜᴛ ꜱᴛʀɪɴɢ ᴡʀɪᴛᴇ ᴀ ᴄᴏɴᴛᴇxᴛ ꜰʀᴇᴇ ɢʀᴀᴍᴍᴀʀ.
• ᴄʜᴇᴄᴋ ᴛʜᴇ ᴀᴍʙɪɢᴜɪᴛʏ ᴏꜰ ᴛʜᴇ ɢʀᴀᴍᴍᴀʀ. ᴀᴅᴅ ᴀᴜɢᴍᴇɴᴛ ᴘʀᴏᴅᴜᴄᴛɪᴏɴ ɪɴ ᴛʜᴇ ɢɪᴠᴇɴ ɢʀᴀᴍᴍᴀʀ
• . ᴄʀᴇᴀᴛᴇ ᴄᴀɴᴏɴɪᴄᴀʟ ᴄᴏʟʟᴇᴄᴛɪᴏɴ ᴏꜰ ʟʀ (0) ɪᴛᴇᴍꜱ. ᴅʀᴀᴡ ᴀ ᴅᴀᴛᴀ ꜰʟᴏᴡ ᴅɪᴀɢʀᴀᴍ (ᴅꜰᴀ).
• ᴄᴏɴꜱᴛʀᴜᴄᴛ ᴀ ʟʀ (1) ᴘᴀʀꜱɪɴɢ ᴛᴀʙʟᴇ.

HOPE IT HELP..

Answer 2

$\huge{\underline{\underline{\bold{Answer}}}}$

LALR refers to the lookahead LR. To construct the LALR (1) parsing table, we use the canonical collection of LR (1) items. LALR (1) parsing is same as the CLR (1) parsing, only difference in the parsing table.

꧁⨳MᎥśś ➳ Iñnocεňt࿐