Bison deterministic LALR parser for C++ (kind of complex langauge) without 'lexar hack' support

[A D]

I need to write a parser for a programming langauge which is as complex as
C++, and to even complicate the matter, there are constructs in this
langauge that doesn't allow me to use type/identifier dis-ambiguating lexer
hack. In other words, I will have to return just one lexical token (say
IDENTIFIER) from the lexer for both type references as well as non-type
variable references.

Given these restrictions, I was wondering if it would be a wise decision
(or if it is even possoble) to use yacc/bison for my parser (given that I
may not have the flexibility to use GLR for performance reasons)...?

Regards,
Arijit