Left corner parser
In computer science, a left corner parser is a type of chart parser used for parsing context-free grammars. It combines the top-down and bottom-up approaches of parsing. The name derives from the use of the left corner of the grammar's production rules.
An early description of a left corner parser is "A Syntax-Oriented Translator" by Peter Zilahy Ingerman.[1][2]
References
- Blackburn, Patrick; Striegnitz, Kristina (August 29, 2002). "Left-Corner Parsing". Natural Language Processing Techniques in Prolog. Schenectady, New York: Union College Computer Science department. Retrieved 30 August 2017.
- Specific
- ^ Ingerman, Peter Zilahy (1966). A Syntax-Oriented Translator. New York City: Academic Press. ISBN 978-1483254296.
- ^ Grune, Dick; Jacobs, Ceriel J.H. (November 28, 2007). "18: Annotated Bibliography" (PDF). Parsing Techniques: A Practical Guide (2nd ed.). New York: Springer. p. 582. ISBN 978-0-387-20248-8. OL 7444312M. Retrieved 30 August 2017.
Readable and realistic (for that time) advice for DIY compiler construction, in archaic terminology. Uses a full backtracking LC parser improved by FIRST sets.
- v
- t
- e
Parsing algorithms
- Earley
- LL
- Recursive descent
- Tail recursive
- Precedence
- Simple
- Operator
- LR
- CYK
- Recursive ascent
- Shift-reduce
- Combinator
- Chart
- Left corner
- Statistical
This computer science article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e