As we have seen in the previous problem, character strings in Pascal have fixed length. However, we treat a string as having a varying length if we ignore all trailing blanks. Consider, for example, the following implementation: CONST STRSIZE = 80; TYPE STRING = RECORD WORD: PACKED ARRAY [1. STRSIZE] of CHAR; length:1.strsize END; where the field length represents the position of the last non trailing-blank character. For example, the string 'HELLOBB... 'has length 5 and 75 trailing blanks, and the string 'GOODbbbBYEbbb.' has length and 70 trailing blanks. Assuming the above definitions, write PROCEDURE SUBSTRING (S1:STRING; var S2:string; p.n: integer); which copies the first n characters, starting with position p in the string S1 into string S2. For example, if S1='ABCDEFGHIJbbb...', then after substring (S1, S2, 4, 3 ) S2 becomes ' DEFbbb.".
As we have seen in the previous problem, character strings in Pascal have fixed length. However, we treat a string as having a varying length if we ignore all trailing blanks. Consider, for example, the following implementation: CONST STRSIZE = 80; TYPE STRING = RECORD WORD: PACKED ARRAY [1. STRSIZE] of CHAR; length:1.strsize END; where the field length represents the position of the last non trailing-blank character. For example, the string 'HELLOBB... 'has length 5 and 75 trailing blanks, and the string 'GOODbbbBYEbbb.' has length and 70 trailing blanks. Assuming the above definitions, write PROCEDURE SUBSTRING (S1:STRING; var S2:string; p.n: integer); which copies the first n characters, starting with position p in the string S1 into string S2. For example, if S1='ABCDEFGHIJbbb...', then after substring (S1, S2, 4, 3 ) S2 becomes ' DEFbbb.".
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
fast
![As we have seen in the previous problem, character strings
in Pascal have fixed length. However, we treat a string as
having a varying length if we ignore all trailing blanks.
Consider, for example, the following implementation:
CONST STRSIZE = 80;
TYPE STRING = RECORD
WORD: PACKED ARRAY [1. STRSIZE] of
CHAR;
length:1.strsize
END;
where the field length represents the position of the last non
trailing-blank character. For example, the string
'HELLOBB... 'has length 5 and 75 trailing blanks, and the
string 'GOODbbbBYEbbb.' has length and 70 trailing
blanks. Assuming the above definitions, write
PROCEDURE SUBSTRING (S1:STRING; var
S2:string; p,n: integer);
which copies the first n characters, starting with position p in
the string S1 into string S2. For example, if
S1='ABCDEFGHIJbbb..', then after substring (S1,
S2, 4, 3 ) S2 becomes ' DEFbb.'.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F7b1505b1-2879-4c82-ae72-ba279e0abddd%2F403b495f-46ab-4ad2-92ee-6ea4943e79cf%2Fv335v7i_processed.jpeg&w=3840&q=75)
Transcribed Image Text:As we have seen in the previous problem, character strings
in Pascal have fixed length. However, we treat a string as
having a varying length if we ignore all trailing blanks.
Consider, for example, the following implementation:
CONST STRSIZE = 80;
TYPE STRING = RECORD
WORD: PACKED ARRAY [1. STRSIZE] of
CHAR;
length:1.strsize
END;
where the field length represents the position of the last non
trailing-blank character. For example, the string
'HELLOBB... 'has length 5 and 75 trailing blanks, and the
string 'GOODbbbBYEbbb.' has length and 70 trailing
blanks. Assuming the above definitions, write
PROCEDURE SUBSTRING (S1:STRING; var
S2:string; p,n: integer);
which copies the first n characters, starting with position p in
the string S1 into string S2. For example, if
S1='ABCDEFGHIJbbb..', then after substring (S1,
S2, 4, 3 ) S2 becomes ' DEFbb.'.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY