Scribd
Upload
2 views

Natural Language Processing

The document is a lab assignment for a student named M. Nathish, focusing on implementing various types of parsers including shift-reduce, recursive descent, and chart parsers using the CYK algorithm. It provides specific grammar rules for multiple examples, such as expressions involving numbers and sentences structured with noun phrases and verb phrases. The assignment includes tasks related to parsing expressions and sentences in natural language processing.

Uploaded by

ragebhanukiran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Natural Language Processing

The document is a lab assignment for a student named M. Nathish, focusing on implementing various types of parsers including shift-reduce, recursive descent, and chart parsers using the CYK algorithm. It provides specific grammar rules for multiple examples, such as expressions involving numbers and sentences structured with noun phrases and verb phrases. The assignment includes tasks related to parsing expressions and sentences in natural language processing.

Uploaded by

ragebhanukiran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Natural Language

Processing
LAB
ASSIGNMENT

NAME: M.Nathish
REG NO:22BCE20374
Question:
implement shift reduce parser, Recurrsive descent parser
and chart parser for the following grammar using CYK
algorithm
1) E->2E2;
E ->3E3; E->4
2)S -> NP VP|NP AUXV VP
NP -> DET NOM|PNOUN|NOUN
VP ->VERB NP| V NP
Pnoun -> JOHN
AuxV -> is
V -> playing
Noun -> Game
ex:- john is playing a game
3)S -> NP VP
NP -> Det N
VP ->V
ex: the cat sleeps
ex:- id+id*id
4)E -> TE'
E' -> +TE'|T'
T->FT'
T' ->*FT'|epsilon
F -> (E)|id

You might also like