Does the compiler analysis phase ever use ambiguous grammars other than operator grammars to make analysis trees?

The operator precedence analyzer is a bottom-up analyzer that uses even ambiguous grammars in the form of operator grammars to analyze a sequence of tokens.

But is there any analyzer that can use ambiguous grammars (of intrinsically ambiguous languages) that is not an operator language to make analysis trees?

P.S: Motivation of this question to know the nature of other languages ‚Äč‚Äčother than $ DCFL $ Used by the syntax phase of the compiler. And also to understand how the analyzer handles. inherently ambiguous $ DCFL $.