Precedence Grammar and Its Transformation

Author

Guo Degui ; Liu Lei ; Wang Shengjun

Author_Institution

Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun

fYear

2006

fDate

9-11 Aug. 2006

Firstpage

171

Lastpage

176

Abstract

Precedence grammar, a special kind of EBNF with precedence between its operators, is introduced in this paper. Programming languages defined in precedence grammars often look simpler, more compact and readable than those defined in other grammars. Actually, this kind of grammar was used early when IEEE published ATLAS - a large test language in 1995, which lead to a great decrease in language size compared to BNF notation, so sometime precedence grammar may be a good choice for defining large programming languages. For the sake of convenient compiler design from these grammars, two algorithms converting precedence grammars to other forms and their correctness discussions are also given in section 3 and section 4

Keywords

grammars; program compilers; programming language semantics; ATLAS; Abbreviated Test Language For All Systems; EBNF; compiler design; precedence grammar transformation; programming languages; Computer languages; Computer science; Computer science education; Educational institutions; Educational programs; Educational technology; Knowledge engineering; Laboratories; Production; Testing; Grammar; Precedence Grammar; Super Grammar; Transformer;

fLanguage

English

Publisher

ieee

Conference_Titel

Software Engineering Research, Management and Applications, 2006. Fourth International Conference on

Conference_Location

Seattle, WA

Print_ISBN

0-7695-2656-X

Type

conf

DOI

10.1109/SERA.2006.53

Filename

1691377