Abstract
Backus [1] has developed an elegant method of defining well-formed formulas for computer languages such as ALGOL. It consists of (our notation is slightly different from that of Backus):
A finite alphabet:
a
1
,
a
2
, …,
a
t
;
Predicates:
P
1
,
P
2
, …,
P
ϵ
;
Productions, either of the form (a)
a
j
∈
P
i
;
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献