Results 231 to 240 of about 2,336,780 (253)
Some of the next articles are maybe not open access.
A top-down no backtrack parsing of general context-free languages
1977A new parsing algorithm is presented. The algorithm works in a top-down manner and it is easily implementable. The algorithm works for all non left-recursive e-free context-free grammars. For LR(1) left-recursion-free grammars works like an LR(1) push-down acceptor.
openaire +2 more sources
Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars
Lecture Notes in Computer Science, 2021Frank Drewes +2 more
exaly
An integrated bottom-up and top-down computing process for car parsing
Proceedings of SPIE, 2009Tianfu Wu
exaly
Top down parsing of macro grammars : (preliminary report)
1976Heydthausen, Manfred, Mehlhorn, Kurt
openaire +2 more sources
Top-Down Parsing: A Comprehensive Review
SSRN Electronic JournalChilamkuri Venkata Sai Pardha Saketh +3 more
openaire +1 more source

