If attacker knows prime number p$>2,$ random no$.$ r$>0,$ g$>2$ which is a primitive root of p$,$ g$^$x$+$r mod p with unknown number x$>0.$

Is it possible for the attacker to obtain g$^$x mod p without knowing x$?$ If yes, how? If no$,$ why?