Talk:Left corner parser

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

AFAIK, a left corner parser is not chart parser

AFAIK, left corner parsers are not chart parsers in the sense that they would keep a chart of already-processed items like CKY-(Younger-Cocke-Kasami) or Earley-Parsers do.

IIRC, they merely keep stacks as the usual Top-Down and Bottom-Up Parsers do.

There exist different algorithms for achieving backtracking and/or look-ahead in Left Corner parsing, though.

I will expand and correct when I find time to do so -- for now, I'll leave the comment here. Please be gentle if this is wrong, this is my first time here.

92.226.109.153 (talk) 11:11, 2 November 2012 (UTC)[reply]

Update to the previous point

As I understand it, one would have to say that left corner parsers can use a table driven approach to achieve a sort of a look-ahead, in that it can be extended to using a (pre-calculated) table which holds information on the possible left corners of each rule. These again represent the plausible predictions in the top-down steps. It strongly seems to me that it would be wrong to categorize a left corner parser as a chart parser per se like the CKY and Earley parsers.

92.226.109.153 (talk) 12:21, 2 November 2012 (UTC)[reply]

LC parsers were known before 1981

I was doing research for a compiler design for class and I saw mention of them in a book before I graduated in 1981. 2607:9B00:5605:6B00:1D02:AF6A:E87B:4922 (talk) 14:12, 8 July 2024 (UTC)[reply]