Method for determining whether a series of end symbols can be ge

Details Method for determining whether a series of end symbols can be ge Method for determining whether a series of end symbols can be ge

1987-02-05

1989-03-28

Zache, Raulfe B.

Boots, shoes, and leggings

364300, G06F 100

Patent

active

048169951

ABSTRACT:
A method and a device for determining the permissibility of a series of a1. . . an end symbols as being derivable by means of a set of production rules on the basis of a context-free grammar G are described. The derivation takes place by assigning dotted rules to elements Ti,j (0.ltoreq.i.ltoreq.j.ltoreq.n) (FIG. 1) of a recognition matrix by means of scan, complete and predict operations. The number of operations is of the order of (n.sup.3). In a first embodiment (n+1) processing modules (FIG. 8) are set up and the successive operations can be limited to a number of the order of (n.sup.2) . In a second embodiment 1/2(n+1)(n+2)-1 processing modules are set up and the successive operations can be limited to a number of the order of (n). The method may be applied in a translation machine.

REFERENCES:
patent: 4591980 (1986-05-01), Huberman et al.
Aho et al., the Theory of Parsing, Translation, and Compiling, vol. 1: Parsing, Prentice-Hall 1972, pp. 320-322.
Graham et al., Parsing of General Context-Free Grammars, Advances in Computers, vol. 14, Academic Press, 1976.

Affiliated with

Also associated with

Rating

Method for determining whether a series of end symbols can be ge does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for determining whether a series of end symbols can be ge, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for determining whether a series of end symbols can be ge will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1664630