LL grammar (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "LL grammar" in English language version.

refsWebsite

Global rank English rank

10doi.org

2^nd place

2archive.org

6^th place

1uwaterloo.ca

3,153^rd place

2,332^nd place

1semanticscholar.org

11^th place

8^th place

1purdue.edu

850^th place

625^th place

archive.org

Kernighan & Ritchie 1988, Appendix A.13 "Grammar", p.193 ff. The top image part shows a simplified excerpt in an EBNF-like notation.. Kernighan, Brian W.; Ritchie, Dennis M. (April 1988). The C Programming Language. Prentice Hall Software Series (2nd ed.). Englewood Cliffs/NJ: Prentice Hall. ISBN 978-013110362-7.
Hopcroft & Ullman (1979, p. 229) Exercise 9.3 Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 978-0-201-02988-8.

doi.org

Rosenkrantz & Stearns (1970, p. 227). Def.1. The authors do not consider the case k=0. Rosenkrantz, D. J.; Stearns, R. E. (1970). "Properties of Deterministic Top Down Grammars". Information and Control. 17 (3): 226–256. doi:10.1016/s0019-9958(70)90446-8.
Rosenkrantz & Stearns (1970, p. 235) Def.2 Rosenkrantz, D. J.; Stearns, R. E. (1970). "Properties of Deterministic Top Down Grammars". Information and Control. 17 (3): 226–256. doi:10.1016/s0019-9958(70)90446-8.
Rosenkrantz & Stearns (1970, p. 235) Theorem 2 Rosenkrantz, D. J.; Stearns, R. E. (1970). "Properties of Deterministic Top Down Grammars". Information and Control. 17 (3): 226–256. doi:10.1016/s0019-9958(70)90446-8.
Rosenkrantz & Stearns (1970, p. 246–247): Using " $+$ " to denote "or", the string set $\{a^{n}(b^{k}d+b+cc)^{n}:n\geq 1\}$ has an $LL(k+1)$ , but no ε-free $LL(k)$ grammar, for each $k\geq 1$ . Rosenkrantz, D. J.; Stearns, R. E. (1970). "Properties of Deterministic Top Down Grammars". Information and Control. 17 (3): 226–256. doi:10.1016/s0019-9958(70)90446-8.
Rosenkrantz & Stearns (1970, pp. 254–255) Rosenkrantz, D. J.; Stearns, R. E. (1970). "Properties of Deterministic Top Down Grammars". Information and Control. 17 (3): 226–256. doi:10.1016/s0019-9958(70)90446-8.
Beatty (1982) Beatty, J. C. (1982). "On the relationship between LL(1) and LR(1) grammars" (PDF). Journal of the ACM. 29 (4 (Oct)): 1007–1022. doi:10.1145/322344.322350. S2CID 14700480.
Rosenkrantz & Stearns (1970, pp. 241) Lemma 5 Rosenkrantz, D. J.; Stearns, R. E. (1970). "Properties of Deterministic Top Down Grammars". Information and Control. 17 (3): 226–256. doi:10.1016/s0019-9958(70)90446-8.
Rosenkrantz & Stearns (1970, p. 242) Theorem 4 Rosenkrantz, D. J.; Stearns, R. E. (1970). "Properties of Deterministic Top Down Grammars". Information and Control. 17 (3): 226–256. doi:10.1016/s0019-9958(70)90446-8.
Korenjak & Hopcroft (1966) Korenjak, A.J.; Hopcroft, J.E. (1966). "Simple deterministic languages". IEEE Conf. Rec. 7th Ann. Symp. on Switching and Automata Theory (SWAT). IEEE Pub. No. Vol. 16-C-40. pp. 36–46. doi:10.1109/SWAT.1966.22.
Rosenkrantz & Stearns (1970, p. 243) Rosenkrantz, D. J.; Stearns, R. E. (1970). "Properties of Deterministic Top Down Grammars". Information and Control. 17 (3): 226–256. doi:10.1016/s0019-9958(70)90446-8.

purdue.edu

docs.lib.purdue.edu

David A. Poplawski (Aug 1977). Properties of LL-Regular Languages (Technical Report). Purdue University, Department of Computer Science.

semanticscholar.org

api.semanticscholar.org

Beatty (1982) Beatty, J. C. (1982). "On the relationship between LL(1) and LR(1) grammars" (PDF). Journal of the ACM. 29 (4 (Oct)): 1007–1022. doi:10.1145/322344.322350. S2CID 14700480.

uwaterloo.ca

cs.uwaterloo.ca

Beatty (1982) Beatty, J. C. (1982). "On the relationship between LL(1) and LR(1) grammars" (PDF). Journal of the ACM. 29 (4 (Oct)): 1007–1022. doi:10.1145/322344.322350. S2CID 14700480.