GitHub - cocom-org/msta: yacc-compatible syntax description translator with additional features like EBNF, producing faster parsers than bison

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 67 Commits
AMMUNITION		AMMUNITION
.gitignore		.gitignore
INSTALL		INSTALL
Makefile.am		Makefile.am
README		README
anal.c		anal.c
anal.h		anal.h
c5.y		c5.y
common.c		common.c
common.h		common.h
configure.ac		configure.ac
contexts.c		contexts.c
contexts.h		contexts.h
cpp5.y		cpp5.y
descript.c		descript.c
descript.h		descript.h
fcalc.y		fcalc.y
fcalc1.y		fcalc1.y
fparse.y		fparse.y
gen-comm.c		gen-comm.c
gen-comm.h		gen-comm.h
gen.c		gen.c
gen.h		gen.h
gram.y		gram.y
ird.c		ird.c
ird.h		ird.h
ird.sprut		ird.sprut
java.y		java.y
la-trie.c		la-trie.c
la-trie.h		la-trie.h
lex.y		lex.y
lr-sets.c		lr-sets.c
lr-sets.h		lr-sets.h
lr.c		lr.c
lr.h		lr.h
m2c.y		m2c.y
main.c		main.c
msta-1.html		msta-1.html
msta-2.html		msta-2.html
msta-3.html		msta-3.html
msta-4.html		msta-4.html
msta-5.html		msta-5.html
msta-6.html		msta-6.html
msta-7.html		msta-7.html
msta-8.html		msta-8.html
msta-9.html		msta-9.html
msta.1		msta.1
msta.dvi		msta.dvi
msta.html		msta.html
msta.info		msta.info
msta.pdf		msta.pdf
msta.ps		msta.ps
msta.sgml.in		msta.sgml.in
msta.tst.in		msta.tst.in
msta.txt		msta.txt
oberon2-gram.y		oberon2-gram.y
oberon2-kw.shilka		oberon2-kw.shilka
oberon2-lex.y		oberon2-lex.y
output.c		output.c
output.h		output.h
p-yacc.y		p-yacc.y
parser.c		parser.c
parser.h		parser.h
pascal.y		pascal.y
quality.tst.in		quality.tst.in
regular.c		regular.c
regular.h		regular.h
relation.c		relation.c
relation.h		relation.h
sql1.y		sql1.y
tab.c		tab.c
tab.h		tab.h
yacc.h		yacc.h
yacc.y		yacc.y

Repository files navigation

  This directory MSTA contains syntax description translator of a
language.  The MSTA can emulate YACC (Posix standard).  The MSTA have
the following additional features:
    
    o Fast LR(k) and LALR(k) grammars (with possibility resolution of
      conflicts).  Look ahead of only necessary depth (not necessary
      given k).  Originally LALR(k) parsers are generated by modified
      fast DeRemer's algorithm.

    o Extended Backus-Naur Form (EBNF), and constructions for more
      convinient description of the scanners. More convinient
      naming attributes.

    o Optimizations (extracting LALR- and regular parts of grammars and
      implementing parsing them by adequate methods) which permit to
      use MSTA for generation of effective lexical analyzers.

    o More safe error recovery and reporting (besides error
      recovery method of YACC).

    o Fast generation of fast parsers.

  To install MSTA see file INSTALL in the current directory.

  Documentation of MSTA is in files `msta.1', `msta.txt', `msta.dvi',
`msta.ps', `msta.info*', `msta*.html'.

Please send bug reports and comments to vmakarov@gcc.gnu.org

Vladimir Makarov