You are to design the ultimate programming language, "Utopia 2010." You have already specified the language's tokens using regular expressions and the language's syntax using a CFG. Now you want to determine those token pairs that require whitespace to separate them (such as else a) and those that require extra look ahead during scanning (such as 10 .Oe-22).
Explain how you could use the regular expressions and CFG to automatically find all token pairs that need special handling.