skip to content
BOUNDED CONTEX SYNTACTIC ANALYSIS. Preview this item
ClosePreview this item
Checking...

BOUNDED CONTEX SYNTACTIC ANALYSIS.

Author: Robert W Floyd; COMPUTER ASSOCIATES INC WOBURN MASS.
Publisher: Ft. Belvoir Defense Technical Information Center SEP 1963.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Certain phrase structure grammars define languages in which the phrasehood and structure of a substring of a sentence may be determined by consideration of only a bounded contex of the substring. It is possible to determine, for any specified bound on the number of contextual characters considered, whether a given grammar is such a bounded context grammar. Such grammars are free from syntactic ambiguity. Syntactic  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Robert W Floyd; COMPUTER ASSOCIATES INC WOBURN MASS.
OCLC Number: 227320671
Description: 10 p.

Abstract:

Certain phrase structure grammars define languages in which the phrasehood and structure of a substring of a sentence may be determined by consideration of only a bounded contex of the substring. It is possible to determine, for any specified bound on the number of contextual characters considered, whether a given grammar is such a bounded context grammar. Such grammars are free from syntactic ambiguity. Syntactic analysis of sentences in a bounded context language may be performed by a standard process, and requires a number of operations proportional to the length of sentence analyzed. Bounded context grammars form models for most languages used in computer programming, and many mehtods of syntactic analysis, including analysis by operator precedence, are special cases of bounded context analysis. (Author).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227320671>
library:oclcnum"227320671"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/227320671>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:datePublished"SEP 1963"
schema:datePublished"1963"
schema:description"Certain phrase structure grammars define languages in which the phrasehood and structure of a substring of a sentence may be determined by consideration of only a bounded contex of the substring. It is possible to determine, for any specified bound on the number of contextual characters considered, whether a given grammar is such a bounded context grammar. Such grammars are free from syntactic ambiguity. Syntactic analysis of sentences in a bounded context language may be performed by a standard process, and requires a number of operations proportional to the length of sentence analyzed. Bounded context grammars form models for most languages used in computer programming, and many mehtods of syntactic analysis, including analysis by operator precedence, are special cases of bounded context analysis. (Author)."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/137060924>
schema:inLanguage"en"
schema:name"BOUNDED CONTEX SYNTACTIC ANALYSIS."@en
schema:numberOfPages"10"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.