A necessary and sufficient condition for a power language to be LL(k)
J. Bordier · The Computer Journal · 1973
We define two families of languages P and P1 and give criteria about the form of the words of these languages used to determine whether they belong to the family of LL(K) languages. Some related results are demonstrated.