Concepts inEfficient computation of LALR(1) look-ahead sets
LALR parser
In computer science, an LALR parser or Look-Ahead LR parser is a type of LR parser with small parse tables and the ability to handle more grammars than SLR parsers. As with other types of LR parser, an LALR parser is quite efficient at finding the single correct bottom-up parse in a single left-to-right scan over the input stream, without guesswork or backtracking. The parser is mechanically generated from a formal grammar for the language.
more from Wikipedia
Efficiency (statistics)
In statistics, efficiency is a term used in the comparison of various statistical procedures and, in particular, it refers to a measure of the optimality of an estimator, of an experimental design or of an hypothesis testing procedure. Essentially, a more efficient estimator, experiment or test needs fewer samples than a less efficient one to achieve a given performance.
more from Wikipedia
Yacc
The computer program Yacc is a parser generator developed by Stephen C. Johnson at AT&T for the Unix operating system in 1970. The name is an acronym for "Yet Another Compiler Compiler. " It generates a parser (the part of a compiler that tries to make syntactic sense of the source code) based on an analytic grammar written in a notation similar to BNF. Yacc used to be available as the default parser generator on most Unix systems.
more from Wikipedia
Time complexity
In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O notation, which suppresses multiplicative constants and lower order terms. When expressed this way, the time complexity is said to be described asymptotically, i.e. , as the input size goes to infinity.
more from Wikipedia