Question: when pda is said to be deterministic?
Answer: In general terms, a deterministic PDA is one in which there is at most one possible transition from any state based on the current input. Any context-free language that can be converted to a deterministic PDA is called a deterministic CFL.