0
make dfa for lexer, then parse tree, then blindly follow 3 rules of lr grammer.
i don't remember entirely.
text book: Compilers by Ravi Sethi and a couple more authors.
or website: geeksforgeeks.com look in cs subjects -> Compilers -> read everything.