HomeSort by relevance Sort by last modified time
    Searched full:lalr (Results 1 - 25 of 39) sorted by null

1 2

  /external/bison/data/
README 11 compatible LALR(1) parsers.
18 A Generalized LR C parser based on Bison's LALR(1) tables.
lalr1.cc 37 b4_copyright([Skeleton interface for Bison LALR(1) parsers in C++],
41 /* C++ LALR(1) parser skeleton written by Akim Demaille. */
305 b4_copyright([Skeleton implementation for Bison LALR(1) parsers in C++],
  /external/bison/src/
lalr.h 39 void lalr (void);
47 /* lalr() builds these data structures. */
main.c 37 #include "lalr.h"
105 /* make it deterministic. In file lalr. */
107 lalr ();
Makefile.am 44 lalr.h lalr.c \
tables.h 1 /* Prepare the LALR and GLR parser tables.
lalr.c 40 #include "lalr.h"
442 lalr (void) function
Makefile 84 lalr.$(OBJEXT) location.$(OBJEXT) main.$(OBJEXT) \
256 lalr.h lalr.c \
377 include ./$(DEPDIR)/lalr.Po
Makefile.in 84 lalr.$(OBJEXT) location.$(OBJEXT) main.$(OBJEXT) \
256 lalr.h lalr.c \
377 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/lalr.Po@am__quote@
print_graph.c 34 #include "lalr.h"
LR0.c 39 #include "lalr.h"
  /external/bison/
Android.mk 51 src/lalr.c \
NEWS 7 for compatibility with LALR(1) grammars.
16 was granted only for Bison-generated LALR(1) parsers in C.
367 size (= sum of the LHS and RHS lengths), larger LALR tables).
481 grammars by making this grammar LALR(1) instead of LR(2). To
ChangeLog 28 * src/getargs.c (usage): Mention GLR not just LALR(1) in --help output.
665 * src/lalr.c (set_goto_map, map_goto):
755 * src/lalr.c (build_relations): Rely on new sentinel.
    [all...]
TODO 47 a sample text exhibiting the (LALR) ambiguity. See the paper from
  /external/bison/lib/
timevar.def 45 DEFTIMEVAR (TV_LALR , "LALR(1)")
  /cts/tools/dasm/src/java_cup/
lalr_item_set.java 7 /** This class represents a set of LALR items. For purposes of building
12 * sub/super-set tests, etc.), as well as an LALR "closure" operation (see
223 /** Compute the closure of the set using the LALR closure rules. Basically
233 * core and the union of the lookahead sets (the LA in LALR stands for
lalr_item.java 5 /** This class represents an LALR item. Each LALR item consists of
288 * matching in LALR items.
lalr_state.java 8 /** This class represents a state in the LALR viable prefix recognition machine.
9 * A state consists of an LALR item set and a set of transitions to other
65 "Attempt to construct an LALR state from a null item set");
69 "Attempt to construct a duplicate LALR state");
233 /** Build an LALR viable prefix recognition machine given a start
259 * states (i.e., corresponding to LALR rather than canonical LR) the state
lalr_transition.java 3 /** This class represents a transition in an LALR viable prefix recognition
  /external/bison/tests/
calc.at 367 # different from LALR's.
538 # Simple LALR Calculator. #
541 AT_BANNER([[Simple LALR(1) Calculator.]])
612 AT_BANNER([[Simple LALR(1) C++ Calculator.]])
  /external/bison/doc/
bison.1 167 Output a VCG definition of the LALR(1) grammar automaton computed by
bison.texinfo 335 annotated context-free grammar into an @acronym{LALR}(1) or
361 permissions applied only when Bison was generating @acronym{LALR}(1)
441 @cindex @acronym{LALR}(1) grammars
445 are called @acronym{LALR}(1) grammars.
449 @acronym{LR}(1) grammar, and @acronym{LALR}(1) involves additional
452 @acronym{LR}(1) grammar that fails to be @acronym{LALR}(1).
461 Parsers for @acronym{LALR}(1) grammars are @dfn{deterministic}, meaning
691 @acronym{LALR}(1) parsing algorithm cannot decide whether to apply a
700 To use a grammar that is not easily modified to be @acronym{LALR}(1), a
706 declarations) identically to @acronym{LALR}(1) parsers. However, whe
    [all...]
bison.info 296 annotated context-free grammar into an LALR(1) or GLR parser for that
327 permissions applied only when Bison was generating LALR(1) parsers in
    [all...]
  /external/bison/djgpp/
README.in 43 Bison's LALR(1) tables and the second one is a experimental C++ parser

Completed in 114 milliseconds

1 2