Hi All
I am using regular expressions to determine how to group certain data. I've included an example of the data below.
USD_SPTR_2Y_725.5_PUT_EUROPEAN_09Q1|USD||European|
CAD_NDX_10Yx1Y_5.5_PUT_EUROPEAN_09Q1|CAD||European|
The regular expressions I am using is as follows and this is... (5 Replies)
I'm trying to have my perl script telnet into the network device execute a command then dump the output of the command into a variable. The script then greps for the word "STANDBY". I can't seem to get the script to print out the output because it seems that the script can't find the word... (1 Reply)
Hi,
i am java guy and new to unix.
I want to validate date pattern using Regex expression
here is the sample program i have written.
#!/bin/sh
checkDate="2010-04-09"
regex="\\d{4}-\\d{2}-\\d{2}\$"
echo $regex
if ]
then
echo "OK"
else
echo "not OK"
fi
But the ouput is... (2 Replies)
Hi,
I am new to scripting.
please help me in validating the user entered time Pattern
Here is the program
#!/bin/bash
validateTimeFormat()
{
checkTime=$1
timePattern="::"
if ]
then
echo "Valid time pattern"
return 1
else
echo "InValid time pattern"
return -1
fi
}
echo "Please... (2 Replies)
What would be the regular expression that can search for a Pattern, having 8 characters out of which atleast 1 digit, 1 lower case, 1 upper case letter and 1 special character must be there. But these can occur at any place randomly. Please help me out.
I'm using find $dir -name "*.txt" -exec... (0 Replies)
Hello,
Awk seem treat the pattern as regular expression, how can awk search not using regular expression? e.g. just represent for "", not "A" or "a" . I don't want to add backslash . (2 Replies)
Hi All,
I have a sftp session log where I am transferring multi files by issuing "mput abc*.dat". The contents of the logfile is below -
#################################################
Connecting to 10.75.112.194...
Changing to: /home/dasd9x/testing1
sftp> mput abc*.dat
Uploading... (7 Replies)
Hello ,
Could anyone help me to define the string in regular expression way .
Below is my string
\rtf1\ansi\deff0{\fonttbl{\f0\fswiss Helv;}{\f1\fnil MS Sans Serif;}}
{\colortbl ;\red0\green0\blue0;}
\viewkind4\uc1\pard\cf1\lang1033\f0\fs16
The string will always start as \rtf1 and... (6 Replies)
Hi All,
I would like to search a regular expression by passing as an i/p variableto AWK.
For Example ::
162.111.101.209.9516
162.111.101.209.41891
162.111.101.209.9516
162.111.101.209.9517
162.111.101.209.41918
162.111.101.209.9517
162.111.101.209.41937
162.111.101.209.41951... (7 Replies)
Hi,
I'm struggling with very very simple task but dont know where I'm going wrong.
Have the following file numbers.txt
1
12
123
1234
12345
123456
1234567
12345678
123456789
1234567890
9876543210
987654321
98765432
9876543
987654
98765 (1 Reply)
Discussion started by: bobbygsk
1 Replies
LEARN ABOUT DEBIAN
regexp
Regexp(3I) InterViews Reference Manual Regexp(3I)NAME
Regexp - regular expression searching
SYNOPSIS
#include <InterViews/regexp.h>
DESCRIPTION
A Regexp encapsulates a regular expression pattern and defines operations for searching and matching the pattern against a string. The
syntax of the regular expression pattern is the same as that for ed(1). Information can be obtained about the most recent match of the
regular expression (and its sub-expressions).
PUBLIC OPERATIONS
Regexp(const char* pattern)
Regexp(const char* pattern, int length)
Construct a new Regexp for pattern.
int Match(const char* text, int length, int index)
Attempt a match against text (of length length) at position index. The return value is the length of the matching string, or a neg-
ative number if the match failed.
int Search(const char* text, int length, int index, int range)
Search for a match in the string text (of length length). Matches are attempted starting at positions between index and index plus
range. If range is positive the first match after index is reported. If range is negative the first match before index is
reported. The return value is the index of the starting position of the match, or a negative number if there is no match in the
specified range.
int BeginningOfMatch(int subexp)
int EndOfMatch(int subexp)
Return information about the most recent match. If subexp is zero (the default), information is reported for the complete regular
expression. Other values of subexp refer to sub-expressions in the pattern. For example, if subexp is 2, information is returned
for the sub-expression specified by the second pair of ( and ) delimiters in the pattern.
SEE ALSO ed(1)InterViews 23 May 1989 Regexp(3I)