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

edit
  • 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
  1. ^ Ingerman, Peter Zilahy (1966). A Syntax-Oriented Translator. New York City: Academic Press. ISBN 978-1483254296.
  2. ^ 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.


📚 Artikel Terkait di Wikipedia

Parsing

Chart parser Compiler-compiler Deterministic parsing DMS Software Reengineering Toolkit Grammar checker Inverse parser LALR parser Left corner parser Lexical

Left corner

left corner table is as follows. Left corners are used to add bottom-up filtering to a top-down parser, or top-down filtering to a bottom-up parser.

LR parser

LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time. There are several variants of LR parsers: SLR

Bottom-up parsing

a LALR parser. Some of the parsers that use bottom-up parsing include: Precedence parser Simple precedence parser Operator-precedence parser Bounded-context

Sentence processing

sentence processing can be found in Hale (2011)'s 'rational' Generalized Left Corner parser. This model derives garden path effects as well as local coherence

Shift-reduce parser

shift-reduce parser scans and parses the input text in one forward pass over the text, without backing up. The parser builds up the parse tree incrementally

Writing system

writer, from bottom to top, but are read left to right; ogham is written from bottom to top, commonly on the corner of a stone. The ancient Libyco-Berber

BeamNG.drive

exceptions) in order to define node/beam constructs. ... We modified the JSON parser a bit to make the life of the vehicle authors easier: McGregor, Ross (13