$L=\left \{ a^{n}b^{n}c^{n}d^{n} | n<10^{10} \right \}$
I know this language is regular language so it is DCFL AND CFL also
but how can we implenment this language with DCFL with stack because till we reach c there will be nothing in the stack to compare c with
this language can be implemented using FA We can have these many states to compare how we will compare in stack
explain the logic of this language with DCFL