Results 11 to 20 of about 31,102,731 (54)
An LALR (1) Parser Grammar for FORTRAN ; CU-CS-129-78 [PDF]
, 1978 An automatic parser generator is a tool for quickly implementing programming language parsers. Parser generators based upon LR parsing have been built for grammars satisfying the LR(0), SLR(1), and LALR(1) properties.
Rauhauser, Russ C.
core +8 more sources
Lexer and Parser Generators in Scheme [PDF]
, 2004 The implementation of a basic LEX-style lexer generator or YACC-style parser generator requires only textbook knowledge. The im-plementation of practical and useful generators that cooperate well with a specific language, however, requires more ...
Olin Shivers +7 more
core
Extending lookahead for LR parsers [PDF]
, 1981 A practical method is presented for extending the lookahead of LR parsers, by the addition of “reduce-arcs.” Applied to an LR(0) parser, this gives a machine which is close in size to the corresponding LALR(1) machine, but is capable of making use of ...
Baker, Theodore P.
core +1 more source
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution [PDF]
, 2010 There has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. As part of that effort, we examine a deficiency in the state of the art of practical LR parser table generation ...
Malloy, Brian A., Denny, Joel E.
core +1 more source
, 1993 LR(1) 문법이지만 LALR(1) 문법이 아닌 문법을 파싱하기 위해서는 그 문법을 LALR(1) 문법으로 변형시키거나 LR(1) 파싱 테이불을 형성하여야 한다. 본 연구에서는 LALR(1) 문법이 아닌 LR(1) 문법의 LALR(1) 파싱에서 발생하는 충돌을 효율적으로 해결하는 새로운 방법을 개발하였다.
Park,Yang-Su +2 more
core +1 more source
LR(k) 문법의 LALR(k)의 문법으로의 변환에 관한 연구
, 1993 본 연구에서는 임의의 LR(k) 문법을 그와 동일한 언어를 생성하는 LALR(k) 문법으로 변환하는 방법이 개발되었다. 이를 위하여 주어진 LR(k) 문법에 대한 LR(k)-colored 문법을 SLR(k) 성질 또는 LALR(k)성질을 유지하면서 축약시키는 방법들이 연구되었으며, 특히 LR(1) 문법을 LALR(1) 문법으로 효율적으로 변환시키는 알고리즘이 개발되었다.We present a method of transforming an ...
Park,Yang-Su, Lee,Myung-Joon
core +1 more source
, 2005 This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing the usage of noncanonical parsers. To this end, we present a definition of noncanonical LALR(1) parsers, NLALR(1).
Sylvain Schmitz
core +1 more source
AN EFFICIENT LALR(1) AND LR(1) LOOKAHEAD SET ALGORITHM
, 2008 . The most popular method for computing LALR(1) lookaheads is not the most efficient one, mainly (as we conjecture) due to certain deficiencies in the description of core algorithms. Similarly, full LR(1) parser generators are not as common as their LALR(
Paulo S. L. M. Barreto
core
LR(1) parser generation system
, 2011 The LR(1) Parser Generation System generates full LR(1) parsers that are comparable in speed and size to those generated by LALR(1) parser generators, such as yacc [5]. In addition to the inherent advantages of full LR(1) parsing, it contains a number of
Peter Donovan, Arthur Sorkin
core +1 more source
(A) study on SLR(1)/LALR(1) parser generating system
, 1979 학위논문 (석사) - 한국과학기술원 : 전산학과, 1979.2, [ [2], 46 p. ]Several practical parsing technique have been proposed since D.E. Knuth``s paper in 1965, such as DeRemer``s SLR(1) and Lalonder``s LALR(1) parsing methods.
장천현, Chang, Chun-Hyon
core +1 more source