DocumentCode
1189754
Title
R68-46 Use of Transition Matrices in Compiling
Author
Earley, J.
Issue
11
fYear
1968
Firstpage
1098
Lastpage
1098
Abstract
Since BNF (context-free) grammars have been found so useful in describing the syntax of programming languages, a large number of parsing algorithms for context-free grammars have been developed for use in compilers and compiler-writing systems. A significant class of these algorithms have the following properties.
Keywords
Computer languages; Matrix converters; Program processors;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1968.226868
Filename
1687272
Link To Document