Описано деякі алгоритми синтаксичного аналізу. Також порівняно продуктивність роботи обраних алгоритмів.
1. Aho, A.V., Sethi, R. and Ullman J.D. (1986) " Compilers: principles, techniques, and tools." Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA.
2. Earley J. An efficient context-free parsing algorithm//ACM 13, 2 (Feb 1970), P. 94-102.
3. Rosenkrantz, D. J.; Stearns, R. E. (1970). «Properties of Deterministic Top Down Grammars». Information and Control 17: 226–256.
4. Sariel Har-Peled and Madhusudan Parthasarathy. Lecture 15: CYK Parsing Algorithm 3 March 2009.
5. DeRemer, Frank; Penello, Thomas (October 1982). «Efficient Computation of LALR(1) Look-Ahead Sets». Tansactions on Programming Languages and Systems (ACM) 4 (4): 615–649. Retrieved July 25, 2014.
6. Peter Kluegl, Martin Atzmueller, Frank Puppe Meta-level Information Extraction. KI 2009: Advances in Artificial Intelligence. Lecture Notes in Computer Science Volume 5803, 2009, pp 233-240.
7. Pratt, Vaughan. «Top down operator precedence.» Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (1973).